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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:38:56,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:38:56,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:38:56,323 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:38:56,323 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:38:56,325 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:38:56,326 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:38:56,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:38:56,330 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:38:56,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:38:56,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:38:56,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:38:56,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:38:56,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:38:56,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:38:56,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:38:56,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:38:56,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:38:56,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:38:56,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:38:56,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:38:56,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:38:56,348 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:38:56,349 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:38:56,349 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:38:56,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:38:56,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:38:56,352 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:38:56,353 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:38:56,354 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:38:56,354 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:38:56,355 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:38:56,355 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:38:56,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:38:56,357 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:38:56,358 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:38:56,358 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:38:56,371 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:38:56,372 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:38:56,373 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:38:56,373 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:38:56,373 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:38:56,373 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:38:56,374 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:38:56,374 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:38:56,374 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:38:56,374 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:38:56,375 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:38:56,375 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:38:56,375 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:38:56,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:38:56,376 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:38:56,376 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:38:56,376 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:38:56,377 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:38:56,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:38:56,377 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:38:56,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:38:56,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:38:56,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:38:56,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:38:56,378 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:38:56,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:38:56,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:38:56,379 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:38:56,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:38:56,379 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:38:56,379 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:38:56,380 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:38:56,380 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:38:56,380 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:38:56,380 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:38:56,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:38:56,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:38:56,381 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:38:56,381 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:38:56,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:38:56,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:38:56,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:38:56,431 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:38:56,431 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:38:56,432 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-01-20 10:38:56,433 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-01-20 10:38:56,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:38:56,470 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:38:56,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:56,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:38:56,471 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:38:56,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... [2019-01-20 10:38:56,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... [2019-01-20 10:38:56,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:38:56,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:38:56,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:38:56,540 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:38:56,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... [2019-01-20 10:38:56,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... [2019-01-20 10:38:56,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... [2019-01-20 10:38:56,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... [2019-01-20 10:38:56,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... [2019-01-20 10:38:56,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... [2019-01-20 10:38:56,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... [2019-01-20 10:38:56,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:38:56,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:38:56,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:38:56,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:38:56,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:38:56,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:38:56,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:38:57,023 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:38:57,023 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-20 10:38:57,024 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:57 BoogieIcfgContainer [2019-01-20 10:38:57,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:38:57,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:38:57,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:38:57,037 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:38:57,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:38:56" (1/2) ... [2019-01-20 10:38:57,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6929c5 and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:38:57, skipping insertion in model container [2019-01-20 10:38:57,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:38:57" (2/2) ... [2019-01-20 10:38:57,044 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-01-20 10:38:57,060 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:38:57,071 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-20 10:38:57,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-20 10:38:57,132 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:38:57,132 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:38:57,132 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:38:57,133 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:38:57,133 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:38:57,133 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:38:57,133 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:38:57,133 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:38:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-20 10:38:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:38:57,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:57,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:38:57,165 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:57,172 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-20 10:38:57,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:57,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:38:57,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:38:57,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:38:57,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:38:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:38:57,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:57,383 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-20 10:38:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:57,574 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-20 10:38:57,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:38:57,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:38:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:57,589 INFO L225 Difference]: With dead ends: 29 [2019-01-20 10:38:57,589 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 10:38:57,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:38:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 10:38:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-20 10:38:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 10:38:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-20 10:38:57,624 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-20 10:38:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:57,626 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-20 10:38:57,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:38:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-20 10:38:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:38:57,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:57,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:38:57,627 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:57,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:57,628 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-20 10:38:57,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:57,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:57,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:57,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:57,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:57,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:38:57,781 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-20 10:38:57,859 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:38:57,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:38:58,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:38:58,977 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:38:58,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:58,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:38:58,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:58,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:59,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:59,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:59,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:59,204 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-20 10:38:59,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:38:59,500 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-20 10:38:59,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:38:59,624 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-20 10:38:59,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:38:59,841 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-20 10:38:59,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:38:59,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:38:59,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:59,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39: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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:00,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:00,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:00,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:00,255 INFO L303 Elim1Store]: Index analysis took 116 ms [2019-01-20 10:39:00,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:00,258 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,308 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,471 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,641 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,655 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,670 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:00,705 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:00,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:00,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:00,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:00,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:00,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:00,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:01,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:01,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:39:01,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:01,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:39:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:39:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:39:01,050 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-20 10:39:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:01,449 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-20 10:39:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:39:01,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:39:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:01,451 INFO L225 Difference]: With dead ends: 47 [2019-01-20 10:39:01,451 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 10:39:01,453 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-01-20 10:39:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 10:39:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-20 10:39:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:39:01,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-20 10:39:01,460 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-20 10:39:01,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:01,460 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-20 10:39:01,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:39:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-20 10:39:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:39:01,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:01,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:39:01,462 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:01,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:01,462 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-20 10:39:01,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:01,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:01,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:01,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:01,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:01,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:01,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:01,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:01,562 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:39:01,562 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-20 10:39:01,564 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:01,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:02,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:02,003 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:02,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:02,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:02,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:02,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:02,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:02,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:02,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:02,233 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-20 10:39:02,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:02,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 24 treesize of output 30 [2019-01-20 10:39:02,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:02,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:02,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:02,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:02,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:02,604 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,978 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:03,343 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-20 10:39:03,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:03,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:03,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,621 INFO L303 Elim1Store]: Index analysis took 162 ms [2019-01-20 10:39:03,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:03,623 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,813 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,833 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,850 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:03,887 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 1 xjuncts. [2019-01-20 10:39:03,888 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:03,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:03,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:04,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:04,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:04,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:04,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:39:04,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:39:04,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:04,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:04,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:04,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:39:04,046 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-20 10:39:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:04,160 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-20 10:39:04,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:39:04,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:39:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:04,162 INFO L225 Difference]: With dead ends: 23 [2019-01-20 10:39:04,162 INFO L226 Difference]: Without dead ends: 22 [2019-01-20 10:39:04,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-01-20 10:39:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-20 10:39:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-20 10:39:04,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 10:39:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-20 10:39:04,170 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-20 10:39:04,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:04,170 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-20 10:39:04,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:39:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-20 10:39:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:39:04,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:04,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:39:04,171 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:04,172 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-20 10:39:04,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:04,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:04,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:04,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:04,294 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:39:04,295 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-20 10:39:04,296 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:04,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:07,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:07,011 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:07,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:07,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:07,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:07,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:07,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:07,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:07,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,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 68 treesize of output 71 [2019-01-20 10:39:07,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:39:07,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:07,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:07,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:07,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:07,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,550 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:07,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:07,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:07,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:07,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:07,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:07,769 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,818 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,887 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,983 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:07,998 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,011 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:08,070 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:08,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:39:08,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:08,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:08,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:08,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:08,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:39:08,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:08,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:39:08,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:39:08,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:39:08,194 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-20 10:39:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:08,407 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-01-20 10:39:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:39:08,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:39:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:08,409 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:39:08,410 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 10:39:08,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:39:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 10:39:08,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-01-20 10:39:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:39:08,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-01-20 10:39:08,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-01-20 10:39:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:08,418 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-01-20 10:39:08,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:39:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-01-20 10:39:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:39:08,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:08,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:39:08,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:08,420 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-20 10:39:08,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:08,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:08,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:08,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:08,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:08,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:08,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:08,477 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:39:08,477 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-20 10:39:08,480 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:08,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:08,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:08,678 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:08,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:08,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:08,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:08,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:08,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:08,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:08,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:08,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:08,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:08,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:08,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:08,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:08,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:08,815 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,867 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:08,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:08,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:08,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:09,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:09,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:09,088 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,104 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,119 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,135 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:09,167 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:09,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:09,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:09,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:09,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:09,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:09,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:09,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:39:09,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:09,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:39:09,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:39:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:39:09,289 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-01-20 10:39:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:09,458 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-01-20 10:39:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:39:09,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:39:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:09,460 INFO L225 Difference]: With dead ends: 49 [2019-01-20 10:39:09,460 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 10:39:09,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:39:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 10:39:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-01-20 10:39:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 10:39:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-01-20 10:39:09,468 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-01-20 10:39:09,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:09,468 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-01-20 10:39:09,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:39:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-01-20 10:39:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:09,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:09,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:09,469 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:09,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:09,470 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-20 10:39:09,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:09,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:09,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:09,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:09,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:09,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:09,536 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-20 10:39:09,537 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:09,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:09,863 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:09,863 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:09,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:09,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:09,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:09,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:09,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:09,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:09,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:09,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:09,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 24 treesize of output 30 [2019-01-20 10:39:09,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:09,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:09,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:09,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:09,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:09,991 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,019 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,073 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,105 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:10,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:10,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:10,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:10,269 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,285 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,302 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,320 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:10,356 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:10,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:10,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:10,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:10,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:10,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:39:10,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:10,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:10,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:39:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:10,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:10,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:10,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:10,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:10,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:10,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:10,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:10,643 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-01-20 10:39:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:11,212 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-01-20 10:39:11,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:11,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:11,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:11,214 INFO L225 Difference]: With dead ends: 61 [2019-01-20 10:39:11,215 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:39:11,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:39:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-20 10:39:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:39:11,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-01-20 10:39:11,225 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-01-20 10:39:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:11,226 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-01-20 10:39:11,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:11,226 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-01-20 10:39:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:11,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:11,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:11,227 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:11,227 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-20 10:39:11,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:11,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:11,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:11,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:11,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:11,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:11,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:11,320 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:11,321 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-20 10:39:11,322 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:11,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:11,684 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:11,684 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:11,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:11,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:11,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:11,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:11,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:11,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:11,923 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-20 10:39:11,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,934 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 68 treesize of output 71 [2019-01-20 10:39:11,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:11,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:39:12,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:12,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:12,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:12,162 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,186 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:12,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:12,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:12,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:12,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:12,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:12,353 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,407 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,439 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,469 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,491 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,512 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:12,571 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:12,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:39:12,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:12,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:12,781 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:12,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:39:12,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:12,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:12,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:39:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:12,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:12,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-01-20 10:39:12,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:12,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:12,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:12,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:12,898 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-01-20 10:39:13,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:13,349 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-01-20 10:39:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:13,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:13,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:13,351 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:39:13,351 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:39:13,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:13,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:39:13,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-20 10:39:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:39:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-20 10:39:13,361 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-20 10:39:13,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:13,361 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-20 10:39:13,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-20 10:39:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:13,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:13,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:13,363 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:13,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:13,363 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-20 10:39:13,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:13,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:13,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:13,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:13,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:13,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:13,446 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:13,446 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-20 10:39:13,449 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:13,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:13,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:13,730 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:13,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:13,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:13,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:13,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:13,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:13,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:13,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:13,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:13,775 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 24 treesize of output 30 [2019-01-20 10:39:13,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:13,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:13,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:13,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:13,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:13,899 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,926 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:13,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:14,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:14,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:14,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:14,142 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,158 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,175 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,191 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:14,225 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:14,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:14,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:14,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:14,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:14,371 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:14,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:39:14,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:14,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:14,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-20 10:39:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:14,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:14,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:14,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:14,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:14,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:14,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:14,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:14,485 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-20 10:39:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:14,929 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-20 10:39:14,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:14,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:14,932 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:39:14,932 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:39:14,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:39:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-20 10:39:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 10:39:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-20 10:39:14,941 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-20 10:39:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:14,942 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-20 10:39:14,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-20 10:39:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:14,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:14,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:14,943 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-20 10:39:14,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:14,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:14,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:14,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:14,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:15,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:15,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:15,133 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:15,133 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-20 10:39:15,134 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:15,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:15,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:15,443 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:15,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:15,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:15,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:15,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:15,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:15,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:15,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:15,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:15,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:15,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:15,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:15,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:15,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,652 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:15,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:15,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:15,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:15,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:15,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:15,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:15,750 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,108 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,316 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,332 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,346 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:16,392 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:16,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:16,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:16,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:16,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:16,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:39:16,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:16,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:16,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:39:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:16,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:16,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:16,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:16,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:16,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:16,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:16,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:16,626 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-20 10:39:16,816 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-20 10:39:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:17,201 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-20 10:39:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:17,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:17,202 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:39:17,203 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:39:17,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:39:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-20 10:39:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:39:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-20 10:39:17,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-20 10:39:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:17,213 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-20 10:39:17,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-20 10:39:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:17,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:17,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:17,215 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:17,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:17,215 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-20 10:39:17,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:17,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:17,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:17,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:17,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:17,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:17,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:17,299 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-20 10:39:17,301 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:17,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:17,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:17,575 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:17,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:17,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:17,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:17,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:17,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:17,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:17,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:17,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:17,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:17,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:17,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:17,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:17,794 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,826 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:17,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:17,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:17,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:17,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:17,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:17,891 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,918 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,937 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,952 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,966 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:17,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:18,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:18,016 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:18,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:18,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:18,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:18,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:18,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:39:18,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:18,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:18,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-20 10:39:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:18,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:18,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:18,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:18,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:18,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:18,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:18,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:18,193 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-20 10:39:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:18,557 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-01-20 10:39:18,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:18,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:18,559 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:39:18,559 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:39:18,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:18,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:39:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-01-20 10:39:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:39:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-01-20 10:39:18,571 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-01-20 10:39:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:18,571 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-01-20 10:39:18,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-01-20 10:39:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:18,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:18,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:18,573 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:18,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:18,573 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-20 10:39:18,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:18,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:18,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:18,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:18,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:18,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:18,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:18,640 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:18,641 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-20 10:39:18,642 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:18,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:18,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:18,852 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:18,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:18,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:18,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:18,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:18,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:18,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:18,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:18,936 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 24 treesize of output 30 [2019-01-20 10:39:18,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:18,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:18,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:18,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:18,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:18,989 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,022 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:19,418 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-20 10:39:19,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:19,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:19,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:19,549 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,564 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,578 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,594 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:19,627 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:19,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:19,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:19,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:19,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:19,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:19,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:19,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:39:19,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:19,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:39:19,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:39:19,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:39:19,799 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-01-20 10:39:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:19,989 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-01-20 10:39:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:39:19,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:39:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:19,990 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:39:19,990 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:39:19,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:39:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:39:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-01-20 10:39:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-20 10:39:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-01-20 10:39:20,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-01-20 10:39:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:20,003 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-01-20 10:39:20,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:39:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-01-20 10:39:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:20,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:20,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:20,005 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:20,005 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-01-20 10:39:20,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:20,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:20,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:20,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:20,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:20,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:20,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:20,083 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:20,084 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-01-20 10:39:20,086 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:20,086 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:20,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:20,492 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:20,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:20,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:20,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:20,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:20,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:20,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:20,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:20,660 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-20 10:39:20,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:39:20,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:39:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:20,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:20,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:20,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:20,913 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:20,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:20,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:21,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:21,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:21,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:21,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:21,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:21,157 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,192 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,213 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,230 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,243 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,256 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:21,304 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:21,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:39:21,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:21,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:21,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:21,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:39:21,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:21,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:21,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-20 10:39:21,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:21,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:21,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:21,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:39:21,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:21,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:21,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:21,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:21,609 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-01-20 10:39:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:22,076 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-01-20 10:39:22,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:22,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:22,078 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:39:22,078 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:39:22,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:39:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-01-20 10:39:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 10:39:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-01-20 10:39:22,091 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-01-20 10:39:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:22,091 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-01-20 10:39:22,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-01-20 10:39:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:22,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:22,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:22,093 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:22,093 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-20 10:39:22,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:22,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:22,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:22,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:22,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:22,204 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:22,204 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-20 10:39:22,205 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:22,205 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:22,498 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:22,498 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:22,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:22,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:22,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:22,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:22,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:22,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:22,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:22,545 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 21 treesize of output 24 [2019-01-20 10:39:22,570 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 24 treesize of output 30 [2019-01-20 10:39:22,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:22,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:22,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:22,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:22,636 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,678 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,753 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:22,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:22,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:22,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:22,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:22,965 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,981 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:22,997 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,014 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:23,048 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:23,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:23,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:23,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:23,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:23,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:39:23,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:23,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:23,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-20 10:39:23,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:23,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:23,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:23,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:23,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:23,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:23,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:23,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:23,254 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-01-20 10:39:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:23,721 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-01-20 10:39:23,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:23,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:23,723 INFO L225 Difference]: With dead ends: 84 [2019-01-20 10:39:23,723 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 10:39:23,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 10:39:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-20 10:39:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-20 10:39:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-01-20 10:39:23,737 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-01-20 10:39:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:23,737 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-01-20 10:39:23,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:23,738 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-01-20 10:39:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:23,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:23,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:23,739 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-20 10:39:23,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:23,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:23,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:23,979 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-20 10:39:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:23,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:23,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:23,993 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:23,993 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-20 10:39:23,995 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:23,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:24,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:24,643 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:24,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:24,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:24,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:24,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:24,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:24,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:24,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:24,715 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 21 treesize of output 24 [2019-01-20 10:39:24,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:24,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:24,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:24,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:24,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:24,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:24,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,911 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 68 treesize of output 71 [2019-01-20 10:39:24,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:24,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:39:25,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:25,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:25,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:25,145 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,169 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,195 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,221 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,245 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:25,292 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:25,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:39:25,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:25,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:25,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:25,445 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:25,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-20 10:39:25,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:25,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:25,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:39:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:25,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:25,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:25,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:25,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:25,619 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-01-20 10:39:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:26,358 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-01-20 10:39:26,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:26,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:26,360 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:39:26,361 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:39:26,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:39:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-01-20 10:39:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 10:39:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-01-20 10:39:26,374 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-01-20 10:39:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:26,374 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-01-20 10:39:26,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-01-20 10:39:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:26,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:26,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:26,376 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-20 10:39:26,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:26,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:26,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:26,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:26,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:26,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:26,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:26,452 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:26,452 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-20 10:39:26,453 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:26,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:26,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:26,615 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:26,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:26,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:26,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:26,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:26,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:26,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:26,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:26,643 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 24 treesize of output 26 [2019-01-20 10:39:26,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,657 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 26 treesize of output 36 [2019-01-20 10:39:26,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:39:26,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:39:26,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:39:26,711 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,738 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:39:26,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:39:26,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:26,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:26,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:26,915 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,929 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,942 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,958 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:26,987 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 1 xjuncts. [2019-01-20 10:39:26,988 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-01-20 10:39:27,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:27,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:27,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:27,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-01-20 10:39:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:27,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:27,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:39:27,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:39:27,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:39:27,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:39:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:39:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:39:27,195 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-01-20 10:39:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:27,260 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-01-20 10:39:27,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:39:27,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:39:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:27,262 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:39:27,262 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:39:27,262 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-01-20 10:39:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:39:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-01-20 10:39:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-20 10:39:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-01-20 10:39:27,281 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-01-20 10:39:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:27,282 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-01-20 10:39:27,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:39:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-01-20 10:39:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:27,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:27,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:27,287 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:27,287 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-20 10:39:27,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:27,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:27,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:27,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:27,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:27,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:27,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:27,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:27,407 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-20 10:39:27,407 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:27,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:27,653 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:27,653 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:27,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:27,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:27,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:27,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:27,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:27,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:27,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:27,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:27,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:27,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:27,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:27,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,954 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:27,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:28,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:28,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:28,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:28,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:28,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:28,039 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,064 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,085 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,100 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,113 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,126 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:28,158 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:28,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:28,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:28,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:28,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:39:28,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:28,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:28,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:39:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:28,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:28,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:28,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:28,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:28,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:28,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:28,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:28,342 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-01-20 10:39:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:28,723 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-01-20 10:39:28,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:28,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:39:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:28,725 INFO L225 Difference]: With dead ends: 121 [2019-01-20 10:39:28,725 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 10:39:28,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 10:39:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-20 10:39:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:39:28,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-20 10:39:28,742 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-20 10:39:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:28,742 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-20 10:39:28,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-20 10:39:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:39:28,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:28,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:39:28,744 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-20 10:39:28,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:28,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:28,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:28,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:28,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:28,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:28,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:28,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:28,793 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:39:28,793 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-20 10:39:28,794 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:28,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:28,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:28,949 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:39:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:28,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:28,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:28,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:28,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:28,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:28,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:28,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:28,981 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 24 treesize of output 26 [2019-01-20 10:39:28,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:28,989 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 26 treesize of output 36 [2019-01-20 10:39:28,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:39:29,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:39:29,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:39:29,036 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,064 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,086 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:39:29,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:39:29,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:39:29,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:39:29,256 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,269 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,284 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:29,332 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-20 10:39:29,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:39:29,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:29,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-20 10:39:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:29,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:29,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:29,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:39:29,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:29,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:39:29,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:39:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:39:29,467 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-01-20 10:39:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:29,696 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-01-20 10:39:29,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:39:29,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:39:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:29,698 INFO L225 Difference]: With dead ends: 110 [2019-01-20 10:39:29,698 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 10:39:29,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:39:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 10:39:29,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-01-20 10:39:29,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:39:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-20 10:39:29,713 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-20 10:39:29,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:29,713 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-20 10:39:29,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:39:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-20 10:39:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:29,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:29,714 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 10:39:29,715 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-01-20 10:39:29,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:29,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:29,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:29,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:29,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:29,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:29,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:29,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:29,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:29,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:29,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:29,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:29,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:29,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:29,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:29,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:29,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:29,857 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 24 treesize of output 30 [2019-01-20 10:39:29,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:29,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:29,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:29,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:29,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:29,908 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:29,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,024 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:39:30,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,145 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 58 treesize of output 67 [2019-01-20 10:39:30,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:30,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:30,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:30,319 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,349 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,374 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,399 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,424 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:30,469 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:30,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:39:30,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:30,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:30,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 103 [2019-01-20 10:39:30,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:30,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-01-20 10:39:30,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:30,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:39:30,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:30,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:30,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-20 10:39:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:30,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:31,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:31,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:31,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:31,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:31,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:31,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:31,498 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-01-20 10:39:32,411 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-20 10:39:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:33,052 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-01-20 10:39:33,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:33,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:33,055 INFO L225 Difference]: With dead ends: 133 [2019-01-20 10:39:33,055 INFO L226 Difference]: Without dead ends: 128 [2019-01-20 10:39:33,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-20 10:39:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-01-20 10:39:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 10:39:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-01-20 10:39:33,075 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-01-20 10:39:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:33,075 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-01-20 10:39:33,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-01-20 10:39:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:33,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:33,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:33,077 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:33,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-20 10:39:33,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:33,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:33,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:33,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:33,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:33,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:33,156 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-20 10:39:33,157 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:33,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:33,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:33,427 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:33,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:33,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:33,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:33,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:33,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:33,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:33,472 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 21 treesize of output 24 [2019-01-20 10:39:33,475 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 24 treesize of output 30 [2019-01-20 10:39:33,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:33,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:33,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:33,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:33,555 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,581 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,618 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:33,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,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 41 treesize of output 53 [2019-01-20 10:39:33,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:33,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:33,799 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,817 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,836 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,853 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:33,906 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:33,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:33,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:33,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:33,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:33,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:33,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:39:33,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:34,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:34,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:39:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:34,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:34,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:34,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:34,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:34,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:34,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:34,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:34,132 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-01-20 10:39:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:34,483 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-01-20 10:39:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:34,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:39:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:34,486 INFO L225 Difference]: With dead ends: 125 [2019-01-20 10:39:34,486 INFO L226 Difference]: Without dead ends: 124 [2019-01-20 10:39:34,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-20 10:39:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-01-20 10:39:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-20 10:39:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-01-20 10:39:34,506 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-01-20 10:39:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:34,507 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-01-20 10:39:34,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:39:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-01-20 10:39:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:34,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:34,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:34,508 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-01-20 10:39:34,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:34,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:34,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:34,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:34,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:34,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:34,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:34,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:34,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:34,663 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-20 10:39:34,664 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:34,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:35,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:35,026 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:35,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:35,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:35,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:35,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:35,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:35,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:35,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,082 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 68 treesize of output 71 [2019-01-20 10:39:35,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,126 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 58 treesize of output 67 [2019-01-20 10:39:35,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:35,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:35,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:35,311 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,339 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:35,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:35,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:35,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:35,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:35,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:35,490 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,526 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,548 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,564 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,576 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,588 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:35,636 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:35,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:39:35,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:35,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:35,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-20 10:39:35,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:35,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:39:35,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,842 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:35,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:35,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:39:35,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:35,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:35,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:39:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:35,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:36,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:36,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:36,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:36,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:36,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:36,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:36,002 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-01-20 10:39:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:37,575 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-01-20 10:39:37,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:37,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:37,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:37,578 INFO L225 Difference]: With dead ends: 149 [2019-01-20 10:39:37,578 INFO L226 Difference]: Without dead ends: 145 [2019-01-20 10:39:37,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:39:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-20 10:39:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-01-20 10:39:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:39:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-01-20 10:39:37,599 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-01-20 10:39:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:37,600 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-01-20 10:39:37,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-01-20 10:39:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:37,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:37,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:37,601 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:37,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:37,601 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-20 10:39:37,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:37,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:37,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:37,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:37,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:37,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:37,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:37,729 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:37,729 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-20 10:39:37,730 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:37,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:38,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:38,278 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:38,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:38,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:38,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:38,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:38,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:38,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:38,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:38,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:38,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:38,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:38,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:38,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:38,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:38,402 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,427 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,446 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:38,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:38,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:38,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:38,639 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,655 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,670 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,686 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:38,718 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:38,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:38,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:38,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:38,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:39:38,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:38,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:39:38,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,892 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:38,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:38,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:39:38,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:38,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:38,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-20 10:39:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:38,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:39,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:39,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:39,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:39,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:39,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:39,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:39,004 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-01-20 10:39:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:39,550 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-01-20 10:39:39,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:39,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:39,553 INFO L225 Difference]: With dead ends: 138 [2019-01-20 10:39:39,553 INFO L226 Difference]: Without dead ends: 136 [2019-01-20 10:39:39,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:39,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-20 10:39:39,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-01-20 10:39:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-20 10:39:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-01-20 10:39:39,589 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-01-20 10:39:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:39,590 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-01-20 10:39:39,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-01-20 10:39:39,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:39,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:39,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:39,591 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:39,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:39,591 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-01-20 10:39:39,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:39,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:39,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:39,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:39,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:39,962 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-20 10:39:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:40,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:40,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:40,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:40,256 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-20 10:39:40,257 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:40,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:40,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:40,636 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:40,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:40,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:40,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:40,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:40,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:40,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:40,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,690 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 68 treesize of output 71 [2019-01-20 10:39:40,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,740 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 58 treesize of output 67 [2019-01-20 10:39:40,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:40,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:40,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:40,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:40,924 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,952 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:40,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:41,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:41,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:41,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:41,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:41,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:41,088 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,125 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,146 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,161 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,175 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,187 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:41,234 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:41,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:39:41,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:41,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:41,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,338 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:41,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:39:41,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:41,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:39:41,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:41,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-20 10:39:41,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:41,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:41,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-20 10:39:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:41,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:41,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:41,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:41,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:41,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:41,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:41,547 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-01-20 10:39:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:42,122 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-01-20 10:39:42,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:42,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:42,126 INFO L225 Difference]: With dead ends: 152 [2019-01-20 10:39:42,126 INFO L226 Difference]: Without dead ends: 151 [2019-01-20 10:39:42,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:39:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-20 10:39:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-01-20 10:39:42,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-20 10:39:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-01-20 10:39:42,144 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-01-20 10:39:42,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:42,144 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-01-20 10:39:42,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-01-20 10:39:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:42,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:42,145 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:42,145 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:42,145 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-20 10:39:42,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:42,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:42,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:42,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:42,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:42,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:42,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:42,345 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:42,345 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-20 10:39:42,346 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:42,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:42,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:42,683 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:42,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:42,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:42,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:42,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:42,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:42,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,737 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 68 treesize of output 71 [2019-01-20 10:39:42,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,789 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 58 treesize of output 67 [2019-01-20 10:39:42,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:42,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:42,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:42,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:42,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:43,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:43,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:43,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:43,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:43,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:43,201 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,251 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,284 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,312 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,330 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,349 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:43,407 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:43,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:39:43,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:43,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:43,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,517 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:43,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:39:43,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:43,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-20 10:39:43,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:43,597 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:43,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-01-20 10:39:43,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:43,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:43,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-01-20 10:39:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:45,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:45,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:45,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:45,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:45,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:45,246 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-01-20 10:39:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:45,967 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-01-20 10:39:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:45,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:45,970 INFO L225 Difference]: With dead ends: 141 [2019-01-20 10:39:45,970 INFO L226 Difference]: Without dead ends: 140 [2019-01-20 10:39:45,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-20 10:39:45,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-01-20 10:39:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-20 10:39:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-01-20 10:39:45,990 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-01-20 10:39:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:45,990 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-01-20 10:39:45,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-01-20 10:39:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:45,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:45,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:45,992 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-20 10:39:45,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:45,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:45,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:45,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:45,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:46,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:46,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:46,069 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:46,069 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-20 10:39:46,073 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:46,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:46,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:46,682 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:46,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:46,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:46,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:46,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:46,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:46,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:46,850 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-20 10:39:46,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:46,854 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 24 treesize of output 30 [2019-01-20 10:39:46,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:46,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:46,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:46,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:46,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:46,902 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,931 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,954 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:46,987 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:47,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:47,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:47,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:47,158 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,174 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,190 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,206 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:47,237 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:47,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:47,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:47,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:47,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,328 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:47,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:39:47,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:47,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-20 10:39:47,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:47,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-20 10:39:47,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:47,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:47,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-20 10:39:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:47,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:47,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:47,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:39:47,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:47,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:47,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:47,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:39:47,490 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-01-20 10:39:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:48,108 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-01-20 10:39:48,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:39:48,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:48,111 INFO L225 Difference]: With dead ends: 163 [2019-01-20 10:39:48,111 INFO L226 Difference]: Without dead ends: 162 [2019-01-20 10:39:48,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:39:48,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-20 10:39:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-01-20 10:39:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-20 10:39:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-01-20 10:39:48,138 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-01-20 10:39:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:48,139 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-01-20 10:39:48,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-01-20 10:39:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:48,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:48,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:48,140 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:48,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:48,140 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-01-20 10:39:48,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:48,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:48,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:48,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:48,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:48,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:48,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:48,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:48,218 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-01-20 10:39:48,219 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:48,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:48,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:48,549 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:48,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:48,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:48,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:48,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:48,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:48,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:48,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,591 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 68 treesize of output 71 [2019-01-20 10:39:48,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,651 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 58 treesize of output 67 [2019-01-20 10:39:48,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:48,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:48,884 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-20 10:39:48,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:48,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:48,897 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,922 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:48,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:49,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:49,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:49,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:49,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:49,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:49,052 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,087 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,107 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,124 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,137 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,149 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:49,195 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:49,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:39:49,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:49,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:49,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:39:49,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:49,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:39:49,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,416 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:49,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:49,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:39:49,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:49,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:49,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:39:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:49,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:49,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:49,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:49,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:49,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:49,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:49,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:49,565 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-01-20 10:39:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:50,249 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-01-20 10:39:50,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:50,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:50,252 INFO L225 Difference]: With dead ends: 163 [2019-01-20 10:39:50,252 INFO L226 Difference]: Without dead ends: 160 [2019-01-20 10:39:50,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-20 10:39:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-01-20 10:39:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-20 10:39:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-01-20 10:39:50,276 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-01-20 10:39:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:50,276 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-01-20 10:39:50,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-01-20 10:39:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:50,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:50,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:50,277 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:50,278 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-20 10:39:50,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:50,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:50,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:50,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:50,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:50,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:50,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:50,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:50,424 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-20 10:39:50,428 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:50,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:50,725 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:50,726 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:39:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:50,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:50,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:50,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:50,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:50,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:50,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:50,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:50,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:50,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:50,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:50,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:50,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:50,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:50,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:50,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:50,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:50,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:50,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:50,993 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,019 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,039 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,055 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,068 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,080 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:51,113 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:51,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:39:51,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:51,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:51,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:39:51,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:51,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:39:51,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,339 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:51,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:51,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:39:51,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:51,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:51,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-20 10:39:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:51,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:51,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:51,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:39:51,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:51,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:51,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:51,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:39:51,454 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-01-20 10:39:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:52,033 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-01-20 10:39:52,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:39:52,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:52,036 INFO L225 Difference]: With dead ends: 165 [2019-01-20 10:39:52,036 INFO L226 Difference]: Without dead ends: 163 [2019-01-20 10:39:52,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:39:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-20 10:39:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-01-20 10:39:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-20 10:39:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-01-20 10:39:52,061 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-01-20 10:39:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:52,061 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-01-20 10:39:52,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-01-20 10:39:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:52,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:52,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:52,063 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:52,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-20 10:39:52,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:52,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:52,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:52,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:52,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:52,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:52,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:52,110 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-20 10:39:52,111 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:52,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:52,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:52,333 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:52,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:52,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:52,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:52,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:52,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:52,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:52,372 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 21 treesize of output 24 [2019-01-20 10:39:52,374 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 24 treesize of output 30 [2019-01-20 10:39:52,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:52,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:52,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:52,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:52,421 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:52,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:52,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:52,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:52,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:52,663 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,680 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,696 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,711 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:52,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:52,745 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:53,200 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-20 10:39:53,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:53,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:39:53,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:53,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:53,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:39:53,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:53,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:53,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:53,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:53,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:53,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:53,280 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:53,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:39:53,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:53,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:53,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-20 10:39:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:53,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:53,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:53,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:39:53,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:53,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:39:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:39:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:39:53,417 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-01-20 10:39:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:53,744 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-01-20 10:39:53,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:39:53,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-20 10:39:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:53,747 INFO L225 Difference]: With dead ends: 158 [2019-01-20 10:39:53,747 INFO L226 Difference]: Without dead ends: 156 [2019-01-20 10:39:53,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-20 10:39:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-01-20 10:39:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-20 10:39:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-01-20 10:39:53,768 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-01-20 10:39:53,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:53,768 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-01-20 10:39:53,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:39:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-01-20 10:39:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:53,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:53,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:53,770 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:53,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:53,770 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-01-20 10:39:53,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:53,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:53,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:53,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:54,345 WARN L181 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-20 10:39:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:54,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:54,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:54,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:54,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:54,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:54,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:54,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:54,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:54,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:39:54,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:54,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:54,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,425 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 68 treesize of output 71 [2019-01-20 10:39:54,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,463 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 58 treesize of output 67 [2019-01-20 10:39:54,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:39:54,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:39:54,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:39:54,634 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,660 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:54,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:54,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:54,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:54,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:54,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:39:54,792 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,827 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,848 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,864 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,878 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,891 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:54,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:54,937 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:39:54,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:54,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:39:54,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:55,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:39:55,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:39:55,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:55,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-20 10:39:55,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:55,133 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:55,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:39:55,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:55,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:55,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:39:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:55,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:55,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:55,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-20 10:39:55,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:55,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:39:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:39:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:39:55,248 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-01-20 10:39:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:55,958 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-01-20 10:39:55,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:39:55,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:39:55,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:55,961 INFO L225 Difference]: With dead ends: 241 [2019-01-20 10:39:55,961 INFO L226 Difference]: Without dead ends: 235 [2019-01-20 10:39:55,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:39:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-20 10:39:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-01-20 10:39:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-20 10:39:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-01-20 10:39:56,000 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-01-20 10:39:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:56,000 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-01-20 10:39:56,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:39:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-01-20 10:39:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:39:56,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:56,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:39:56,002 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:56,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:56,002 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-20 10:39:56,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:56,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:56,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:56,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:56,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:39:56,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:56,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:56,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:39:56,364 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-20 10:39:56,364 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:39:56,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:39:56,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:39:56,692 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:39:56,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:56,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:39:56,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:56,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:56,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:56,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:56,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:56,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:39:56,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:39:56,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:39:56,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:39:56,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:39:56,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:39:56,807 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:56,837 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:56,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:56,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:56,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:56,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:56,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:39:56,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:56,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:39:57,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:39:57,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:39:57,082 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,119 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,136 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,153 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:57,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:39:57,187 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:39:57,430 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-20 10:39:57,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,589 INFO L303 Elim1Store]: Index analysis took 155 ms [2019-01-20 10:39:57,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:39:57,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:39:57,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:39:57,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-01-20 10:39:57,919 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-20 10:39:57,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:57,929 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:39:57,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-20 10:39:57,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:58,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:58,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:58,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:58,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:58,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:58,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:58,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:58,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:39:58,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-20 10:39:58,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-20 10:39:58,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-20 10:39:58,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-01-20 10:39:58,676 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-01-20 10:39:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:58,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:58,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:58,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:39:58,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:58,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:39:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:39:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:39:58,817 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-01-20 10:39:59,302 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-20 10:39:59,814 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-20 10:40:00,091 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-01-20 10:40:00,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:00,371 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-01-20 10:40:00,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:00,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:40:00,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:00,374 INFO L225 Difference]: With dead ends: 208 [2019-01-20 10:40:00,374 INFO L226 Difference]: Without dead ends: 207 [2019-01-20 10:40:00,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-20 10:40:00,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-01-20 10:40:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-20 10:40:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-01-20 10:40:00,417 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-01-20 10:40:00,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:00,417 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-01-20 10:40:00,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-01-20 10:40:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:00,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:00,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:00,419 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:00,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:00,419 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-01-20 10:40:00,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:00,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:00,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:00,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:00,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:00,696 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-01-20 10:40:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:00,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:00,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:00,721 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:00,721 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-20 10:40:00,722 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:00,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:01,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:01,144 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:01,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:01,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:01,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:01,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:01,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:01,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:01,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:40:01,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:40:01,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:40:01,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:40:01,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,345 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:01,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:40:01,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:01,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:01,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:01,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:40:01,422 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,447 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,467 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,482 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,495 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:01,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:01,538 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:40:01,780 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-20 10:40:01,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:01,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:40:01,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:40:01,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-20 10:40:01,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-20 10:40:02,190 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-20 10:40:02,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 103 [2019-01-20 10:40:02,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:40:02,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 89 [2019-01-20 10:40:02,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:02,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-20 10:40:02,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-01-20 10:40:02,740 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-20 10:40:02,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:02,783 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:02,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 118 [2019-01-20 10:40:02,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:40:03,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,114 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:03,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-20 10:40:03,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:03,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:03,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 110 [2019-01-20 10:40:03,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:03,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-20 10:40:03,444 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-01-20 10:40:03,585 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 84 [2019-01-20 10:40:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:03,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:03,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:03,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:40:03,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:03,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:03,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:03,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:40:03,672 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-01-20 10:40:04,337 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-01-20 10:40:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:04,935 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-01-20 10:40:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:40:04,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:40:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:04,940 INFO L225 Difference]: With dead ends: 280 [2019-01-20 10:40:04,940 INFO L226 Difference]: Without dead ends: 279 [2019-01-20 10:40:04,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:40:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-20 10:40:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-01-20 10:40:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-20 10:40:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-01-20 10:40:04,985 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-01-20 10:40:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:04,985 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-01-20 10:40:04,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-01-20 10:40:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:04,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:04,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:04,987 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-20 10:40:04,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:04,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:04,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:04,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:04,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:05,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:40:05,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:40:05,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:40:05,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:40:05,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:40:05,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:40:05,236 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-01-20 10:40:05,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:05,332 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-01-20 10:40:05,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:40:05,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:40:05,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:05,336 INFO L225 Difference]: With dead ends: 201 [2019-01-20 10:40:05,336 INFO L226 Difference]: Without dead ends: 198 [2019-01-20 10:40:05,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:40:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-20 10:40:05,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-20 10:40:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-20 10:40:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-01-20 10:40:05,381 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-01-20 10:40:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:05,381 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-01-20 10:40:05,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:40:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-01-20 10:40:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:05,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:05,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:05,383 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:05,383 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-20 10:40:05,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:05,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:05,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:05,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:05,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:05,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:05,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:05,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:05,480 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-20 10:40:05,481 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:05,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:05,695 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:05,696 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:05,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:05,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:05,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:05,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:05,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:05,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:05,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:05,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:40:05,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:40:05,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:40:05,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:05,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:40:05,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,917 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:05,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:05,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:40:05,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:05,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:05,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:05,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:40:05,985 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:06,010 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:06,027 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:06,043 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:06,055 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:06,065 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:06,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:06,098 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:40:06,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:40:06,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:06,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:06,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:40:06,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:06,188 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:06,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:40:06,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:06,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:06,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-20 10:40:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:06,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:06,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:06,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:40:06,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:06,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:40:06,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:40:06,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:06,278 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-01-20 10:40:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:06,619 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-01-20 10:40:06,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:40:06,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:40:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:06,623 INFO L225 Difference]: With dead ends: 208 [2019-01-20 10:40:06,623 INFO L226 Difference]: Without dead ends: 207 [2019-01-20 10:40:06,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:40:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-20 10:40:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-01-20 10:40:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-20 10:40:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-01-20 10:40:06,663 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-01-20 10:40:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:06,663 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-01-20 10:40:06,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-01-20 10:40:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:06,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:06,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:06,665 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:06,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:06,665 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-20 10:40:06,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:06,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:06,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:06,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:06,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:06,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:06,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:06,807 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:06,807 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-20 10:40:06,808 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:06,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:07,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:07,055 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:07,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:07,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:07,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:07,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:07,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:07,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:07,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:40:07,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:40:07,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:40:07,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:40:07,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:07,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:40:07,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:40:07,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:40:07,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:40:07,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:40:07,420 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,444 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,462 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,477 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,487 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,499 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:07,529 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:40:07,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:40:07,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:07,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:40:07,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:07,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-20 10:40:07,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:07,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:07,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-20 10:40:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:07,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:07,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:07,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:40:07,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:07,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:40:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:40:07,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:07,719 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-01-20 10:40:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:08,032 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-01-20 10:40:08,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:40:08,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:40:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:08,036 INFO L225 Difference]: With dead ends: 210 [2019-01-20 10:40:08,036 INFO L226 Difference]: Without dead ends: 208 [2019-01-20 10:40:08,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:40:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-20 10:40:08,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-01-20 10:40:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-20 10:40:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-01-20 10:40:08,074 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-01-20 10:40:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:08,074 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-01-20 10:40:08,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-01-20 10:40:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:08,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:08,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:08,075 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:08,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:08,075 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-01-20 10:40:08,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:08,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:08,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:08,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:08,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:40:08,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:40:08,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:08,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:08,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:40:08,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:40:08,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:40:08,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:40:08,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:08,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,288 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 68 treesize of output 71 [2019-01-20 10:40:08,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,331 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 58 treesize of output 67 [2019-01-20 10:40:08,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:40:08,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:40:08,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:08,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:40:08,524 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,557 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:08,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:40:08,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:08,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:08,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:08,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:40:08,747 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:08,985 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:09,017 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:09,032 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:09,048 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:09,061 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:09,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:09,107 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:40:09,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:40:09,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:09,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:09,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:40:09,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:40:09,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:09,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:09,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-20 10:40:09,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:09,338 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:09,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-20 10:40:09,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:09,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:09,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:40:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:09,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:09,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:09,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:40:09,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:09,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:09,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:09,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:09,480 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-01-20 10:40:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:11,052 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-01-20 10:40:11,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:11,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:40:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:11,055 INFO L225 Difference]: With dead ends: 242 [2019-01-20 10:40:11,056 INFO L226 Difference]: Without dead ends: 240 [2019-01-20 10:40:11,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:40:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-20 10:40:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-01-20 10:40:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-20 10:40:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-01-20 10:40:11,091 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-01-20 10:40:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:11,092 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-01-20 10:40:11,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-01-20 10:40:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:11,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:11,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:11,093 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:11,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-20 10:40:11,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:11,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:40:11,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:11,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:11,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:11,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:11,222 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:11,222 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-20 10:40:11,225 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:11,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:11,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:11,527 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:11,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:11,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:11,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:11,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:11,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:11,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:11,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:11,571 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 21 treesize of output 24 [2019-01-20 10:40:11,573 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 24 treesize of output 30 [2019-01-20 10:40:11,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:11,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:11,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:11,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:40:11,624 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:11,664 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:11,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:11,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:11,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:11,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:11,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,768 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 68 treesize of output 71 [2019-01-20 10:40:11,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,808 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 58 treesize of output 67 [2019-01-20 10:40:11,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:40:11,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:40:11,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:11,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:40:11,987 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:12,013 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:12,039 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:12,066 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:12,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:12,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:12,138 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:40:12,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:40:12,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:12,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:12,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:40:12,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:40:12,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:12,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:12,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-20 10:40:12,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:12,370 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:12,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-01-20 10:40:12,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:12,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:12,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:40:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:12,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:12,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:12,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:40:12,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:12,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:12,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:12,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:12,506 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-01-20 10:40:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:13,122 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-01-20 10:40:13,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:13,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:40:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:13,126 INFO L225 Difference]: With dead ends: 249 [2019-01-20 10:40:13,126 INFO L226 Difference]: Without dead ends: 247 [2019-01-20 10:40:13,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:40:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-20 10:40:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-01-20 10:40:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-20 10:40:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-01-20 10:40:13,160 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-01-20 10:40:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:13,160 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-01-20 10:40:13,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-01-20 10:40:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:13,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:13,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:13,162 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-20 10:40:13,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:13,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:13,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:13,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:13,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:13,376 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-20 10:40:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:13,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:13,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:13,408 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:13,408 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-20 10:40:13,410 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:13,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:13,719 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:13,719 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:13,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:13,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:13,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:13,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:13,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:13,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:13,767 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 21 treesize of output 24 [2019-01-20 10:40:13,772 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 24 treesize of output 30 [2019-01-20 10:40:13,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:13,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:13,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:13,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:13,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:40:13,822 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,869 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,904 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,960 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:13,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:40:14,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:40:14,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:40:14,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:40:14,163 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,213 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,244 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:14,275 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:40:14,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:40:14,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:14,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:40:14,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:40:14,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:14,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-20 10:40:14,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:14,458 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:14,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:40:14,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:14,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:14,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:40:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:14,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:14,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:14,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:40:14,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:14,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:14,613 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-01-20 10:40:15,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:15,162 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-01-20 10:40:15,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:15,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:40:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:15,167 INFO L225 Difference]: With dead ends: 260 [2019-01-20 10:40:15,167 INFO L226 Difference]: Without dead ends: 258 [2019-01-20 10:40:15,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:40:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-20 10:40:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-01-20 10:40:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-20 10:40:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-20 10:40:15,203 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-20 10:40:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:15,203 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-20 10:40:15,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-20 10:40:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:15,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:15,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:15,204 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:15,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:15,205 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-20 10:40:15,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:15,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:15,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:15,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:15,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:15,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:15,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:15,246 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:15,246 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-20 10:40:15,247 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:15,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:15,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:15,474 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:15,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:15,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:15,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:15,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:15,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:15,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:15,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:15,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:15,508 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 24 treesize of output 26 [2019-01-20 10:40:15,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:40:15,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:40:15,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:40:15,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:40:15,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,607 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,627 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,657 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:40:15,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:40:15,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:40:15,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:40:15,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:15,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:40:15,887 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,912 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,936 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,960 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:15,985 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:16,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:16,030 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:40:16,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:16,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:40:16,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:16,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:16,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:40:16,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:16,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:16,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:16,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:16,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:16,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:16,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:16,131 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:16,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 101 [2019-01-20 10:40:16,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:16,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:16,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-01-20 10:40:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:16,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:16,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:16,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:40:16,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:16,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:40:16,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:40:16,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:16,236 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-20 10:40:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:16,544 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-01-20 10:40:16,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:40:16,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:40:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:16,548 INFO L225 Difference]: With dead ends: 244 [2019-01-20 10:40:16,548 INFO L226 Difference]: Without dead ends: 243 [2019-01-20 10:40:16,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:40:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-20 10:40:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-01-20 10:40:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-20 10:40:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-20 10:40:16,588 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-20 10:40:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:16,588 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-20 10:40:16,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-20 10:40:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:16,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:16,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:16,590 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:16,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:16,590 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-20 10:40:16,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:16,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:16,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:16,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:16,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:16,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:16,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:16,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:16,760 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:16,760 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-20 10:40:16,761 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:16,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:17,019 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:17,019 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:17,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:17,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:17,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:17,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:17,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:17,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:17,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:17,109 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 24 treesize of output 26 [2019-01-20 10:40:17,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:17,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:17,185 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 26 treesize of output 36 [2019-01-20 10:40:17,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:17,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:17,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:17,291 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-20 10:40:17,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:40:17,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:17,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:17,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:17,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:17,426 INFO L303 Elim1Store]: Index analysis took 132 ms [2019-01-20 10:40:17,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:40:17,558 INFO L303 Elim1Store]: Index analysis took 129 ms [2019-01-20 10:40:17,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:40:17,560 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:17,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:18,219 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:18,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:18,598 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:18,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:18,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:40:18,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:40:18,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:40:18,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:18,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:40:18,768 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:18,784 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:18,798 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:18,815 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:18,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:18,846 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:40:19,042 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-20 10:40:19,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:40:19,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-20 10:40:19,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-20 10:40:19,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:389 [2019-01-20 10:40:19,637 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 82 [2019-01-20 10:40:19,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-20 10:40:19,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-20 10:40:19,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:19,832 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:19,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 80 [2019-01-20 10:40:19,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:19,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-20 10:40:19,900 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:178, output treesize:126 [2019-01-20 10:40:20,020 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-20 10:40:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:20,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:20,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:20,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:40:20,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:20,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:40:20,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:40:20,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:20,085 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-20 10:40:20,489 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-20 10:40:20,874 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-01-20 10:40:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:31,488 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-01-20 10:40:31,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:40:31,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:40:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:31,493 INFO L225 Difference]: With dead ends: 273 [2019-01-20 10:40:31,493 INFO L226 Difference]: Without dead ends: 272 [2019-01-20 10:40:31,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:40:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-20 10:40:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-01-20 10:40:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-20 10:40:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-01-20 10:40:31,530 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-01-20 10:40:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:31,530 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-01-20 10:40:31,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-01-20 10:40:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:31,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:31,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:31,531 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-01-20 10:40:31,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:31,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:31,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:31,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:31,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:31,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:31,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:31,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:40:31,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:40:31,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:31,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:31,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:40:31,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:40:31,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:40:31,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:40:31,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:31,702 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 21 treesize of output 24 [2019-01-20 10:40:31,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 24 treesize of output 30 [2019-01-20 10:40:31,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:31,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:31,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:31,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:40:31,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:31,782 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:31,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:31,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:31,840 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:31,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:31,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:40:31,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:40:31,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:31,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:40:32,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:40:32,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:40:32,109 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:32,136 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:32,162 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:32,189 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:32,216 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:32,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:32,263 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:40:32,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:40:32,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:32,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:32,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:40:32,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,371 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:32,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-20 10:40:32,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:32,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:32,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:40:32,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:32,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-20 10:40:32,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:32,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:32,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-20 10:40:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:32,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:32,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:32,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:40:32,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:32,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:32,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:32,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:40:32,576 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-01-20 10:40:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:33,313 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-01-20 10:40:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:40:33,313 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:40:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:33,318 INFO L225 Difference]: With dead ends: 274 [2019-01-20 10:40:33,318 INFO L226 Difference]: Without dead ends: 273 [2019-01-20 10:40:33,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:40:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-20 10:40:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-01-20 10:40:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-20 10:40:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-20 10:40:33,360 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-20 10:40:33,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:33,360 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-20 10:40:33,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-20 10:40:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:33,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:33,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:33,361 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:33,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:33,362 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-01-20 10:40:33,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:33,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:33,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:40:33,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:33,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:33,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:33,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:33,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:33,544 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-01-20 10:40:33,545 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:33,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:35,238 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:35,238 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:40:35,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:35,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:35,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:35,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:35,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:35,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:35,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:35,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:40:35,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:40:35,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:40:35,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:40:35,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:40:35,467 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:35,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, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:40:35,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:40:35,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:40:35,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:40:35,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:40:35,623 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,655 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,675 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,690 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,702 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,714 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:35,759 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-20 10:40:35,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:35,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:40:35,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:35,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:35,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-01-20 10:40:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:35,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:35,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:35,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:40:35,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:35,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:40:35,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:40:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:40:35,874 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-01-20 10:40:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:36,086 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-01-20 10:40:36,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:40:36,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-20 10:40:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:36,090 INFO L225 Difference]: With dead ends: 242 [2019-01-20 10:40:36,090 INFO L226 Difference]: Without dead ends: 241 [2019-01-20 10:40:36,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-01-20 10:40:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-20 10:40:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-20 10:40:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-20 10:40:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-20 10:40:36,130 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-20 10:40:36,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:36,130 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-20 10:40:36,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:40:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-20 10:40:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:36,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:36,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:36,132 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:36,132 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-01-20 10:40:36,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:36,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:36,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:36,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:36,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:36,325 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-20 10:40:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:36,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:36,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:36,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:36,364 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-20 10:40:36,364 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:36,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:37,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:37,062 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:37,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:37,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:37,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:37,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:37,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:37,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:37,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:37,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,108 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 68 treesize of output 71 [2019-01-20 10:40:37,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:40:37,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:40:37,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:40:37,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:40:37,335 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:37,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:40:37,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:37,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:37,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:37,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:40:37,499 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,535 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,556 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,572 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,584 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,595 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:37,642 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:40:37,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:40:37,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:37,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:40:37,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:40:37,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:37,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:40:37,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:37,844 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:37,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 128 [2019-01-20 10:40:37,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:37,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:37,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:40:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:37,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:37,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:37,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:40:37,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:37,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:37,980 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-01-20 10:40:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:38,611 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-01-20 10:40:38,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:38,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:40:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:38,616 INFO L225 Difference]: With dead ends: 276 [2019-01-20 10:40:38,616 INFO L226 Difference]: Without dead ends: 274 [2019-01-20 10:40:38,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:40:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-20 10:40:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-01-20 10:40:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-20 10:40:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-01-20 10:40:38,663 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-01-20 10:40:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:38,664 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-01-20 10:40:38,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-01-20 10:40:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:38,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:38,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:38,665 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:38,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:38,665 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-20 10:40:38,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:38,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:38,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:38,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:38,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:38,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:38,716 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-20 10:40:38,717 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:38,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:38,970 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:38,970 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:38,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:38,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:38,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:38,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:38,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:38,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:39,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:40:39,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:40:39,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:40:39,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:40:39,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:39,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:40:39,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:39,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:39,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:39,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:40:39,238 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,266 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,285 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,301 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,315 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:39,369 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:40:39,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:40:39,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:39,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:40:39,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:39,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:40:39,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:39,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:39,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:40:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:39,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:39,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:39,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:40:39,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:39,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:40:39,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:40:39,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:39,894 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-01-20 10:40:40,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:40,303 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-01-20 10:40:40,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:40,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:40:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:40,306 INFO L225 Difference]: With dead ends: 288 [2019-01-20 10:40:40,306 INFO L226 Difference]: Without dead ends: 287 [2019-01-20 10:40:40,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:40:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-20 10:40:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-01-20 10:40:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-20 10:40:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-01-20 10:40:40,361 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-01-20 10:40:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:40,361 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-01-20 10:40:40,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-01-20 10:40:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:40:40,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:40,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:40:40,363 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:40,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:40,363 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-01-20 10:40:40,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:40,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:40,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:40,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:40,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:40,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:40,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:40,408 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:40:40,408 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-01-20 10:40:40,409 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:40,409 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:40,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:40,624 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:40,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:40,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:40,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:40,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:40,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:40,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:40,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:40,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:40,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:40:40,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,668 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 26 treesize of output 36 [2019-01-20 10:40:40,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:40:40,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:40:40,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:40:40,740 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:40,768 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:40,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:40,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:40,820 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:40,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:40,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:40:40,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:40:40,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:40:40,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:40,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:40:40,958 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:40,973 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:40,987 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:41,004 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:41,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:41,035 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-20 10:40:41,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:41,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:40:41,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:40:41,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:40:41,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-20 10:40:41,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:41,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:41,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:41,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:41,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:41,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:40:41,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:41,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:41,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-01-20 10:40:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:41,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:41,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:41,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:40:41,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:41,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:40:41,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:40:41,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:40:41,280 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-01-20 10:40:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:41,680 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-01-20 10:40:41,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:40:41,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:40:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:41,684 INFO L225 Difference]: With dead ends: 319 [2019-01-20 10:40:41,684 INFO L226 Difference]: Without dead ends: 318 [2019-01-20 10:40:41,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:41,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-20 10:40:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-01-20 10:40:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-20 10:40:41,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-20 10:40:41,760 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-01-20 10:40:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:41,761 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-20 10:40:41,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:40:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-20 10:40:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:41,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:41,762 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:40:41,762 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:41,762 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-01-20 10:40:41,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:41,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:41,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:41,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:41,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:41,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:41,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:41,835 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:40:41,835 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-01-20 10:40:41,836 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:41,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:41,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:41,983 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:40:41,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:41,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:41,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:41,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:41,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:41,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:42,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:42,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:40:42,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:40:42,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:40:42,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:40:42,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,152 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,222 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 21 treesize of output 24 [2019-01-20 10:40:42,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:40:42,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:40:42,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:40:42,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:40:42,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:40:42,251 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,275 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,292 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,307 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,317 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,329 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:42,359 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-20 10:40:42,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:40:42,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:42,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:40:42,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-20 10:40:42,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:42,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:42,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-20 10:40:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:42,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:42,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:42,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:40:42,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:42,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:40:42,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:40:42,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:40:42,560 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-01-20 10:40:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:42,774 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-01-20 10:40:42,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:40:42,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-20 10:40:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:42,779 INFO L225 Difference]: With dead ends: 290 [2019-01-20 10:40:42,779 INFO L226 Difference]: Without dead ends: 289 [2019-01-20 10:40:42,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-20 10:40:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-01-20 10:40:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-20 10:40:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-20 10:40:42,846 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-01-20 10:40:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:42,846 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-20 10:40:42,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:40:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-20 10:40:42,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:42,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:42,848 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-20 10:40:42,848 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:42,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:42,849 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-01-20 10:40:42,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:42,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:42,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:42,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:42,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:42,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:42,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:42,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:40:42,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:40:42,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:42,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:42,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:40:42,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:40:42,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:40:42,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:40:42,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:42,988 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 21 treesize of output 24 [2019-01-20 10:40:42,992 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 24 treesize of output 30 [2019-01-20 10:40:42,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:42,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:43,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:43,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:43,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:40:43,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,055 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,077 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:40:43,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:40:43,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:40:43,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:40:43,278 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,295 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,311 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,327 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:43,362 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-20 10:40:43,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:40:43,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:43,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:40:43,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:40:43,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:43,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:40:43,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:40:43,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:43,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-20 10:40:43,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:43,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:40:43,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:43,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:43,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:40:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:43,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:43,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:43,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:40:43,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:43,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:40:43,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:40:43,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:40:43,756 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-01-20 10:40:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:44,354 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-01-20 10:40:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:40:44,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:40:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:44,360 INFO L225 Difference]: With dead ends: 423 [2019-01-20 10:40:44,361 INFO L226 Difference]: Without dead ends: 421 [2019-01-20 10:40:44,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:40:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-20 10:40:44,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-01-20 10:40:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-20 10:40:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-01-20 10:40:44,485 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-01-20 10:40:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:44,485 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-01-20 10:40:44,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:40:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-01-20 10:40:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:44,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:44,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:40:44,487 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-01-20 10:40:44,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:44,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:40:44,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:44,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:44,653 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:40:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:44,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:44,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:44,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:40:44,873 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-01-20 10:40:44,873 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:44,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:45,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:45,207 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:45,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:45,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:45,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:45,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:45,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:45,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:45,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:45,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:40:45,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:45,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:45,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:45,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:40:45,303 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,370 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,394 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,475 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 68 treesize of output 71 [2019-01-20 10:40:45,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,515 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 58 treesize of output 67 [2019-01-20 10:40:45,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:40:45,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:40:45,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:40:45,685 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,710 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,734 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,759 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,785 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:45,830 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:40:45,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:40:45,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:45,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:40:45,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:45,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:40:45,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:45,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:45,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:40:46,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:46,030 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:46,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-20 10:40:46,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:46,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:46,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-20 10:40:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:46,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:46,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:46,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:40:46,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:46,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:46,256 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-01-20 10:40:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:46,921 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-01-20 10:40:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:46,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:40:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:46,926 INFO L225 Difference]: With dead ends: 368 [2019-01-20 10:40:46,926 INFO L226 Difference]: Without dead ends: 366 [2019-01-20 10:40:46,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:40:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-20 10:40:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-01-20 10:40:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-20 10:40:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-01-20 10:40:46,991 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-01-20 10:40:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:46,991 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-01-20 10:40:46,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-01-20 10:40:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:46,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:46,993 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:40:46,993 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:46,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:46,993 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-01-20 10:40:46,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:46,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:46,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:46,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:46,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:47,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:47,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:47,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:40:47,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:40:47,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:47,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:47,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:40:47,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:40:47,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:40:47,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:40:47,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:47,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:47,100 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 24 treesize of output 30 [2019-01-20 10:40:47,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:47,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:47,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:47,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:40:47,206 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,245 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,269 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,301 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,348 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 68 treesize of output 71 [2019-01-20 10:40:47,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:40:47,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:40:47,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:40:47,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:40:47,562 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,586 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,610 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,636 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,660 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:47,707 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:40:47,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:40:47,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:47,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:40:47,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:40:47,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:47,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:40:47,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,897 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:47,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:40:47,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:47,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:47,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:40:47,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:47,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 135 [2019-01-20 10:40:47,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:48,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:48,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-01-20 10:40:48,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:48,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:48,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:48,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:40:48,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:48,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:40:48,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:40:48,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:40:48,137 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-01-20 10:40:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:48,937 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-01-20 10:40:48,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:40:48,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:40:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:48,943 INFO L225 Difference]: With dead ends: 407 [2019-01-20 10:40:48,943 INFO L226 Difference]: Without dead ends: 401 [2019-01-20 10:40:48,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:40:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-01-20 10:40:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-01-20 10:40:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-20 10:40:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-01-20 10:40:49,020 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-01-20 10:40:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:49,020 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-01-20 10:40:49,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:40:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-01-20 10:40:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:49,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:49,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:40:49,022 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-01-20 10:40:49,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:49,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:40:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:49,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:49,322 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-20 10:40:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:49,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:49,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:49,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:40:49,460 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-01-20 10:40:49,461 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:49,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:49,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:49,843 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:40:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:49,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:49,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:49,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:49,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:49,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:49,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:49,882 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 21 treesize of output 24 [2019-01-20 10:40:49,885 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 24 treesize of output 30 [2019-01-20 10:40:49,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:49,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:49,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:49,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:49,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:40:49,975 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,025 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,053 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,136 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 68 treesize of output 71 [2019-01-20 10:40:50,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:40:50,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:40:50,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:40:50,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:40:50,351 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,377 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,403 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,429 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,456 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:50,503 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:40:50,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:40:50,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:50,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:40:50,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:40:50,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:50,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-20 10:40:50,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,711 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:50,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:40:50,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:50,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:40:50,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,803 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:50,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:50,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-20 10:40:50,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:50,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:50,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-20 10:40:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:50,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:50,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:50,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:40:50,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:50,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:40:50,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:40:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:40:50,984 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-01-20 10:40:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:52,103 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-01-20 10:40:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 10:40:52,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:40:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:52,111 INFO L225 Difference]: With dead ends: 645 [2019-01-20 10:40:52,111 INFO L226 Difference]: Without dead ends: 643 [2019-01-20 10:40:52,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:40:52,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-01-20 10:40:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-01-20 10:40:52,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-01-20 10:40:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-01-20 10:40:52,218 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-01-20 10:40:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:52,218 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-01-20 10:40:52,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:40:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-01-20 10:40:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:52,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:52,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:40:52,220 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-01-20 10:40:52,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:52,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:52,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:52,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:52,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:52,302 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:40:52,303 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-01-20 10:40:52,304 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:52,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:52,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:52,522 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:40:52,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:52,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:52,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:52,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:52,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:52,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:52,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:52,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:52,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:40:52,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:40:52,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:40:52,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:40:52,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:40:52,608 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:40:52,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:40:52,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:40:52,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:40:52,819 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,834 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,848 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,864 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:52,895 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:40:52,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:52,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:40:52,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:52,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:52,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:40:53,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:53,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:40:53,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:40:53,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:40:53,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-01-20 10:40:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:53,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:53,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:53,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-20 10:40:53,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:53,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:40:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:40:53,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:40:53,228 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-01-20 10:40:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:53,779 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-01-20 10:40:53,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:40:53,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:40:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:53,786 INFO L225 Difference]: With dead ends: 527 [2019-01-20 10:40:53,786 INFO L226 Difference]: Without dead ends: 524 [2019-01-20 10:40:53,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:40:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-20 10:40:53,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-01-20 10:40:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-20 10:40:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-01-20 10:40:53,908 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-01-20 10:40:53,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:53,908 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-01-20 10:40:53,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:40:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-01-20 10:40:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:53,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:53,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:40:53,910 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:53,910 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-01-20 10:40:53,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:53,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:53,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:54,061 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:40:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:40:54,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:54,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:54,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:40:54,103 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-01-20 10:40:54,104 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:54,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:54,411 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:54,411 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:54,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:54,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:54,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:54,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:54,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:54,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:54,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:54,464 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 24 treesize of output 30 [2019-01-20 10:40:54,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:40:54,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:40:54,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:40:54,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:40:54,508 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,538 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,560 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:40:54,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:40:54,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:40:54,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:40:54,789 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,809 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,824 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,840 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:54,874 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:40:54,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:40:54,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:54,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:54,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:40:54,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:54,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:40:54,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:55,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:55,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:40:55,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:55,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:55,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-20 10:40:55,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:55,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:55,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:40:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:55,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:55,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:55,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:40:55,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:55,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:55,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:55,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:55,183 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-01-20 10:40:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:55,807 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-01-20 10:40:55,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:55,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:40:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:55,815 INFO L225 Difference]: With dead ends: 534 [2019-01-20 10:40:55,816 INFO L226 Difference]: Without dead ends: 533 [2019-01-20 10:40:55,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:40:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-01-20 10:40:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-01-20 10:40:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-20 10:40:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-01-20 10:40:55,938 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-01-20 10:40:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:55,938 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-01-20 10:40:55,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-01-20 10:40:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:55,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:55,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:40:55,940 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:55,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:55,940 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-01-20 10:40:55,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:55,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:55,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:56,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:56,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:56,001 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:40:56,002 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-01-20 10:40:56,003 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:56,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:56,306 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:56,306 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:56,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:56,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:56,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:56,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:56,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:56,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:56,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:40:56,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,347 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 26 treesize of output 36 [2019-01-20 10:40:56,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:40:56,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:40:56,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:40:56,392 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,433 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:40:56,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,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 53 treesize of output 63 [2019-01-20 10:40:56,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:40:56,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:40:56,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:40:56,715 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,738 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,763 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,786 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,813 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:56,857 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:40:56,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:40:56,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:56,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:56,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:40:56,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:56,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-20 10:40:56,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:57,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:57,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-20 10:40:57,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,091 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:57,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:57,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 114 [2019-01-20 10:40:57,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:57,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:57,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-20 10:40:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:57,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:57,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:57,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:40:57,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:57,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:57,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:57,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:57,222 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-01-20 10:40:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:57,851 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-01-20 10:40:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:57,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:40:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:57,857 INFO L225 Difference]: With dead ends: 543 [2019-01-20 10:40:57,857 INFO L226 Difference]: Without dead ends: 542 [2019-01-20 10:40:57,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:40:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-20 10:40:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-01-20 10:40:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-20 10:40:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-01-20 10:40:57,978 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-01-20 10:40:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:40:57,979 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-01-20 10:40:57,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:40:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-01-20 10:40:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:40:57,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:40:57,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:40:57,981 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:40:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-01-20 10:40:57,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:40:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:40:57,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:40:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:58,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:58,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:40:58,065 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:40:58,065 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-01-20 10:40:58,066 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:40:58,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:40:58,365 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:40:58,365 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:40:58,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:40:58,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:40:58,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:40:58,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:40:58,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:40:58,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:40:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:40:58,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:40:58,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:40:58,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:40:58,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,414 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 26 treesize of output 36 [2019-01-20 10:40:58,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:40:58,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:40:58,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:40:58,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,490 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:40:58,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:40:58,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:40:58,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:40:58,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:40:58,769 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,792 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,817 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,842 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,870 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:58,914 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:40:58,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:58,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:40:58,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:58,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:58,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:40:59,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-20 10:40:59,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:59,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:59,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-20 10:40:59,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:40:59,126 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:40:59,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-20 10:40:59,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:40:59,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:40:59,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-20 10:40:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:59,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:40:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:40:59,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:40:59,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:40:59,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:40:59,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:40:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:40:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:40:59,258 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-01-20 10:40:59,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:40:59,983 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-01-20 10:40:59,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:40:59,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:40:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:40:59,987 INFO L225 Difference]: With dead ends: 537 [2019-01-20 10:40:59,987 INFO L226 Difference]: Without dead ends: 536 [2019-01-20 10:40:59,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:40:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-20 10:41:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-01-20 10:41:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-01-20 10:41:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-01-20 10:41:00,135 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-01-20 10:41:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:00,135 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-01-20 10:41:00,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:41:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-01-20 10:41:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:00,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:00,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:00,137 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-01-20 10:41:00,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:00,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:00,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:00,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:00,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:00,331 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:41:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:00,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:00,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:00,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:00,375 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-01-20 10:41:00,376 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:00,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:00,676 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:00,677 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:41:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:00,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:00,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:00,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:00,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:00,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:00,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:00,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:00,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:00,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:00,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:00,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:00,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:41:00,771 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,811 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,834 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:00,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,912 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 68 treesize of output 71 [2019-01-20 10:41:00,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,948 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 58 treesize of output 67 [2019-01-20 10:41:00,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:00,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:41:01,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:41:01,187 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-20 10:41:01,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:41:01,199 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:01,224 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:01,250 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:01,276 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:01,302 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:01,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:01,348 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:41:01,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:41:01,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:01,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:01,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:41:01,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,454 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:01,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:41:01,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:01,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:01,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-20 10:41:01,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:01,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-20 10:41:01,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:01,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:01,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-20 10:41:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:01,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:01,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:01,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:41:01,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:01,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:41:01,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:41:01,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:41:01,688 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-01-20 10:41:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:02,394 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-01-20 10:41:02,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:41:02,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:41:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:02,399 INFO L225 Difference]: With dead ends: 588 [2019-01-20 10:41:02,399 INFO L226 Difference]: Without dead ends: 587 [2019-01-20 10:41:02,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:41:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-20 10:41:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-01-20 10:41:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-01-20 10:41:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-01-20 10:41:02,528 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-01-20 10:41:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:02,529 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-01-20 10:41:02,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:41:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-01-20 10:41:02,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:02,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:02,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:02,530 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:02,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-01-20 10:41:02,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:02,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:02,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:02,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:02,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:02,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:02,606 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:02,606 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-01-20 10:41:02,607 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:02,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:03,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:03,012 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:41:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:03,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:03,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:03,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:03,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:03,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:03,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:03,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:03,108 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 24 treesize of output 26 [2019-01-20 10:41:03,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:41:03,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:41:03,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,391 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-20 10:41:03,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:41:03,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,524 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-01-20 10:41:03,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:41:03,526 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,603 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,653 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:41:03,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:41:03,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:41:03,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:41:03,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:03,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:41:03,880 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,907 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,930 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,954 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:03,981 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:04,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:04,025 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:41:04,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:04,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:41:04,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:04,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:04,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:41:04,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:04,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:04,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:04,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:04,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:04,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:04,126 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:04,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-20 10:41:04,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:04,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:04,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-01-20 10:41:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:04,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:04,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:04,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:41:04,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:04,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:41:04,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:41:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:41:04,233 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-01-20 10:41:04,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:04,737 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-01-20 10:41:04,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:41:04,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:41:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:04,742 INFO L225 Difference]: With dead ends: 558 [2019-01-20 10:41:04,742 INFO L226 Difference]: Without dead ends: 557 [2019-01-20 10:41:04,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:41:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-01-20 10:41:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-01-20 10:41:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-01-20 10:41:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-01-20 10:41:04,870 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-01-20 10:41:04,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:04,870 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-01-20 10:41:04,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:41:04,871 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-01-20 10:41:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:04,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:04,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:04,872 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-01-20 10:41:04,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:04,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:04,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:04,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:04,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:04,989 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:04,990 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-01-20 10:41:04,990 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:04,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:05,272 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:05,272 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:41:05,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:05,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:05,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:05,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:05,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:05,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:05,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:05,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:41:05,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:41:05,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:41:05,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:41:05,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:05,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:05,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:05,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:05,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:05,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:41:05,552 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,578 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,597 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,614 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,628 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,640 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:05,674 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:41:05,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:41:05,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:05,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:41:05,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,764 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:05,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:41:05,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:05,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-20 10:41:05,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:05,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-20 10:41:05,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:05,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:05,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-20 10:41:05,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-01-20 10:41:05,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:05,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:05,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:41:05,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:05,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:41:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:41:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:41:05,926 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-01-20 10:41:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:06,663 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-01-20 10:41:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:41:06,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:41:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:06,668 INFO L225 Difference]: With dead ends: 795 [2019-01-20 10:41:06,669 INFO L226 Difference]: Without dead ends: 794 [2019-01-20 10:41:06,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:41:06,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-01-20 10:41:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-01-20 10:41:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-20 10:41:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-01-20 10:41:06,815 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-01-20 10:41:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:06,816 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-01-20 10:41:06,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:41:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-01-20 10:41:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:06,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:06,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:06,817 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:06,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:06,818 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-01-20 10:41:06,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:06,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:06,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:06,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:06,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:06,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:06,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:06,938 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-01-20 10:41:06,939 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:06,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:07,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:07,156 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:41:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:07,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:07,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:07,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:07,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:07,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:07,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:07,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:07,182 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 24 treesize of output 26 [2019-01-20 10:41:07,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,196 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 26 treesize of output 36 [2019-01-20 10:41:07,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:41:07,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:41:07,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:41:07,241 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,268 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,288 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:41:07,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:41:07,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:41:07,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:41:07,456 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,471 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,485 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,502 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:07,534 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:41:07,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:41:07,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:07,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:07,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:41:07,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:07,633 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:07,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:41:07,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:41:07,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:07,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-01-20 10:41:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:07,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:07,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:07,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-20 10:41:07,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:07,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:41:07,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:41:07,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:41:07,820 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-01-20 10:41:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:08,530 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-01-20 10:41:08,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:41:08,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:41:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:08,534 INFO L225 Difference]: With dead ends: 539 [2019-01-20 10:41:08,534 INFO L226 Difference]: Without dead ends: 538 [2019-01-20 10:41:08,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:41:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-20 10:41:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-01-20 10:41:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-20 10:41:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-01-20 10:41:08,731 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-01-20 10:41:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:08,732 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-01-20 10:41:08,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:41:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-01-20 10:41:08,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:08,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:08,733 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:41:08,733 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-01-20 10:41:08,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:08,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:08,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:08,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:08,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:08,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:41:08,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:41:08,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:08,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:08,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:08,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:08,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:08,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:08,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:08,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:08,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:08,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:08,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:08,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:08,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:08,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:08,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:08,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:08,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:08,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:08,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:08,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:41:08,909 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:08,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:08,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:08,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:08,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:09,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:09,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:41:09,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:41:09,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:41:09,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:41:09,198 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:09,216 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:09,233 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:09,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:09,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:09,310 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:41:09,552 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-20 10:41:09,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:41:09,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:41:09,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:09,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-20 10:41:09,902 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-20 10:41:09,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2019-01-20 10:41:09,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:09,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:09,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 91 [2019-01-20 10:41:10,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-20 10:41:10,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:41:10,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-01-20 10:41:10,410 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-20 10:41:10,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 101 [2019-01-20 10:41:10,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 111 [2019-01-20 10:41:10,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:41:10,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:10,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-20 10:41:10,736 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-01-20 10:41:10,959 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-20 10:41:10,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:10,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 125 [2019-01-20 10:41:11,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:41:11,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:41:11,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:11,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,510 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:11,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:11,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-20 10:41:11,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:11,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-20 10:41:11,655 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-01-20 10:41:11,792 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 83 [2019-01-20 10:41:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:11,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:11,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:11,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:41:11,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:11,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:41:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:41:11,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:41:11,892 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-01-20 10:41:12,147 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-20 10:41:12,783 WARN L181 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-01-20 10:41:13,231 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-01-20 10:41:13,762 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-01-20 10:41:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:14,626 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-01-20 10:41:14,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:41:14,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:41:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:14,631 INFO L225 Difference]: With dead ends: 678 [2019-01-20 10:41:14,631 INFO L226 Difference]: Without dead ends: 673 [2019-01-20 10:41:14,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:41:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-01-20 10:41:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-01-20 10:41:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-01-20 10:41:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-01-20 10:41:14,843 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-01-20 10:41:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:14,843 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-01-20 10:41:14,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:41:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-01-20 10:41:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:14,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:14,844 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:41:14,844 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:14,845 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-01-20 10:41:14,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:14,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:14,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:14,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:14,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:41:14,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:41:14,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:14,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:14,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:41:14,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:41:14,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:41:14,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:41:14,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:14,953 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 21 treesize of output 24 [2019-01-20 10:41:14,955 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 24 treesize of output 30 [2019-01-20 10:41:14,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:14,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:14,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:14,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:14,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:41:14,999 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,139 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 68 treesize of output 71 [2019-01-20 10:41:15,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,180 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 58 treesize of output 67 [2019-01-20 10:41:15,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:41:15,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:41:15,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:41:15,400 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,434 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,467 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,501 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,528 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:15,575 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:41:15,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:41:15,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:15,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:41:15,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,784 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-01-20 10:41:15,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:41:15,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:15,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:41:15,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:41:15,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:15,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:15,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-01-20 10:41:15,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:15,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 135 [2019-01-20 10:41:15,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:16,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:16,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-01-20 10:41:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:16,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:16,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:16,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:41:16,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:16,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:41:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:41:16,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:41:16,111 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-01-20 10:41:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:16,984 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-01-20 10:41:16,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:41:16,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:41:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:16,990 INFO L225 Difference]: With dead ends: 704 [2019-01-20 10:41:16,990 INFO L226 Difference]: Without dead ends: 703 [2019-01-20 10:41:16,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:41:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-01-20 10:41:17,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-01-20 10:41:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-01-20 10:41:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-01-20 10:41:17,275 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-01-20 10:41:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:17,275 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-01-20 10:41:17,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:41:17,276 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-01-20 10:41:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:17,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:17,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:17,277 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-01-20 10:41:17,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:17,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:17,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:41:17,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:17,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:17,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:17,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:17,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:41:17,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:41:17,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:17,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:17,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:41:17,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:41:17,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:41:17,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:41:17,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:17,494 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 21 treesize of output 24 [2019-01-20 10:41:17,497 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 24 treesize of output 30 [2019-01-20 10:41:17,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:17,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:17,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:17,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:41:17,523 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,562 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:41:17,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,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 58 treesize of output 67 [2019-01-20 10:41:17,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:41:17,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:41:17,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:17,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:41:17,883 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,910 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,936 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,962 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:17,989 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:18,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:18,036 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:41:18,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:41:18,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:18,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:18,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:41:18,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:41:18,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:18,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-01-20 10:41:18,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:41:18,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,239 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:18,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:41:18,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:18,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:18,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:41:18,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,331 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:18,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:18,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-20 10:41:18,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:18,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:18,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-20 10:41:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:18,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:18,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:18,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:41:18,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:18,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:41:18,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:41:18,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:41:18,485 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-01-20 10:41:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:19,835 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-01-20 10:41:19,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:41:19,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:41:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:19,842 INFO L225 Difference]: With dead ends: 1218 [2019-01-20 10:41:19,842 INFO L226 Difference]: Without dead ends: 1217 [2019-01-20 10:41:19,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:41:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-01-20 10:41:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-01-20 10:41:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-01-20 10:41:20,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-01-20 10:41:20,172 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-01-20 10:41:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:20,172 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-01-20 10:41:20,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:41:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-01-20 10:41:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:20,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:20,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:20,174 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:20,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:20,174 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-01-20 10:41:20,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:20,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:20,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:41:20,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:20,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:20,318 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:41:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:20,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:20,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:20,364 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:20,364 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-01-20 10:41:20,365 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:20,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:20,663 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:20,664 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:41:20,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:20,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:20,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:20,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:20,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:20,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:20,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:20,729 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 24 treesize of output 30 [2019-01-20 10:41:20,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:20,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:20,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:20,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:41:20,768 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:20,819 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:20,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:20,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:20,875 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:20,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:20,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:41:20,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:20,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:41:21,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:41:21,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:41:21,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:41:21,139 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:21,164 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:21,190 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:21,216 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:21,241 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:21,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:21,288 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:41:21,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:41:21,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:21,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:21,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:41:21,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,405 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:21,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-20 10:41:21,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:21,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:21,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-01-20 10:41:21,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:21,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:41:21,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:21,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:21,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-01-20 10:41:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:21,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:21,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:21,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:41:21,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:21,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:41:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:41:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:41:21,842 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-01-20 10:41:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:22,673 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-01-20 10:41:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:41:22,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:41:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:22,677 INFO L225 Difference]: With dead ends: 814 [2019-01-20 10:41:22,677 INFO L226 Difference]: Without dead ends: 811 [2019-01-20 10:41:22,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:41:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-20 10:41:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-01-20 10:41:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-01-20 10:41:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-01-20 10:41:22,984 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-01-20 10:41:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:22,984 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-01-20 10:41:22,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:41:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-01-20 10:41:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:22,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:22,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:22,986 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-01-20 10:41:22,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:22,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:22,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:23,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:23,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:23,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:23,089 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-01-20 10:41:23,090 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:23,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:23,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:23,399 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:41:23,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:23,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:23,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:23,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:23,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:23,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:23,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:23,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:41:23,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:41:23,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:41:23,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:41:23,575 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:23,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:23,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:23,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:23,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:23,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:41:23,670 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,696 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,716 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,732 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,745 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,757 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,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-01-20 10:41:23,791 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:41:23,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:41:23,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:23,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:41:23,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,908 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:23,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:41:23,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:23,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:23,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-20 10:41:23,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:23,970 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:23,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:41:23,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:24,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:24,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:41:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:24,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:24,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:24,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:41:24,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:24,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:41:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:41:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:41:24,081 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-01-20 10:41:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:24,985 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-01-20 10:41:24,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:41:24,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:41:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:24,989 INFO L225 Difference]: With dead ends: 812 [2019-01-20 10:41:24,989 INFO L226 Difference]: Without dead ends: 811 [2019-01-20 10:41:24,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:41:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-20 10:41:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-01-20 10:41:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-01-20 10:41:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-01-20 10:41:25,289 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-01-20 10:41:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:25,289 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-01-20 10:41:25,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:41:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-01-20 10:41:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:25,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:25,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:25,291 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-01-20 10:41:25,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:25,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:25,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:25,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:25,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:25,673 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-01-20 10:41:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:25,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:25,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:25,758 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:25,758 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-01-20 10:41:25,759 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:25,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:25,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:25,995 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:41:25,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:25,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:25,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:25,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:26,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:26,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:26,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:26,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:26,046 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 24 treesize of output 26 [2019-01-20 10:41:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:41:26,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:41:26,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:41:26,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:41:26,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,156 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,173 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:41:26,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:41:26,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:41:26,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:41:26,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:41:26,416 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,439 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,463 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,487 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,514 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:26,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:26,558 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:41:26,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:26,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:41:26,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:41:27,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:27,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-20 10:41:27,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:27,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:27,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:27,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:41:27,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:27,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:27,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-01-20 10:41:27,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-01-20 10:41:27,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:27,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:27,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:41:27,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:27,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:41:27,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:41:27,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:41:27,694 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-01-20 10:41:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:28,378 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-01-20 10:41:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:41:28,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:41:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:28,381 INFO L225 Difference]: With dead ends: 843 [2019-01-20 10:41:28,381 INFO L226 Difference]: Without dead ends: 842 [2019-01-20 10:41:28,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:41:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-01-20 10:41:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-01-20 10:41:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-01-20 10:41:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-01-20 10:41:28,690 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-01-20 10:41:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:28,690 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-01-20 10:41:28,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:41:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-01-20 10:41:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:28,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:28,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:28,693 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-01-20 10:41:28,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:28,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:28,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:28,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:28,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:28,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:28,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:28,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:28,762 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-01-20 10:41:28,763 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:28,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:29,077 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:29,077 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:41:29,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:29,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:29,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:29,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:29,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:29,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:29,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:29,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:41:29,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:41:29,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:41:29,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:41:29,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:29,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:29,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:29,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:29,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:29,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:41:29,375 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,402 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,422 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,438 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,451 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,462 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:29,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:29,495 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:41:29,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:41:29,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:41:29,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:29,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-20 10:41:29,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:29,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 103 [2019-01-20 10:41:29,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:41:30,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,211 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:30,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2019-01-20 10:41:30,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:30,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-01-20 10:41:30,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-01-20 10:41:30,824 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-01-20 10:41:30,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2019-01-20 10:41:30,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:30,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,963 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:30,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:30,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 100 [2019-01-20 10:41:30,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:31,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,096 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:31,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 94 [2019-01-20 10:41:31,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:31,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:31,227 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:31,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:41:31,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:31,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-20 10:41:31,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-01-20 10:41:31,458 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-01-20 10:41:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:31,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:31,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-01-20 10:41:31,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:31,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:41:31,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:31,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:41:31,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:41:31,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:41:31,535 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-01-20 10:41:31,726 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-20 10:41:31,960 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-20 10:41:32,366 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-01-20 10:41:33,009 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-01-20 10:41:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:33,314 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-01-20 10:41:33,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:41:33,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:41:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:33,318 INFO L225 Difference]: With dead ends: 896 [2019-01-20 10:41:33,318 INFO L226 Difference]: Without dead ends: 895 [2019-01-20 10:41:33,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:41:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-20 10:41:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-01-20 10:41:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-01-20 10:41:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-01-20 10:41:33,662 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-01-20 10:41:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:33,662 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-01-20 10:41:33,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:41:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-01-20 10:41:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:33,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:33,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:33,664 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-01-20 10:41:33,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:33,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:33,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:33,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:33,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:33,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:33,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:33,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:33,728 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-01-20 10:41:33,730 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:33,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:34,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:34,018 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:41:34,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:34,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:34,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:34,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:34,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:34,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:34,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:41:34,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:41:34,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:41:34,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:41:34,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:34,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:34,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:34,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:34,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:34,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:41:34,318 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,346 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,366 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,383 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,396 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,408 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:34,441 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-20 10:41:34,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:41:34,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:34,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:41:34,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:41:34,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:34,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-20 10:41:34,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:34,605 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:34,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:41:34,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:34,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:34,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:41:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:34,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:34,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:34,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:41:34,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:34,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:41:34,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:41:34,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:41:34,840 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-01-20 10:41:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:35,840 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-01-20 10:41:35,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:41:35,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:41:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:35,845 INFO L225 Difference]: With dead ends: 975 [2019-01-20 10:41:35,845 INFO L226 Difference]: Without dead ends: 973 [2019-01-20 10:41:35,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:41:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-01-20 10:41:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-01-20 10:41:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-01-20 10:41:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-01-20 10:41:36,212 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-01-20 10:41:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:36,213 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-01-20 10:41:36,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:41:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-01-20 10:41:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:36,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:36,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:36,215 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-01-20 10:41:36,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:36,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:36,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:36,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:36,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:41:36,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:36,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:36,359 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:36,360 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-01-20 10:41:36,361 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:36,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:36,606 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:36,606 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:41:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:36,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:36,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:36,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:36,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:36,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:36,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:36,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:36,635 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 24 treesize of output 26 [2019-01-20 10:41:36,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:41:36,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:41:36,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:41:36,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:41:36,693 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,741 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:41:36,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:41:36,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:41:36,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:36,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:41:36,907 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,922 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,936 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,952 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:36,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:36,983 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:41:37,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:41:37,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:41:37,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:37,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-20 10:41:37,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 86 [2019-01-20 10:41:37,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:37,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:37,349 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:37,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 59 [2019-01-20 10:41:37,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:37,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:41:37,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-01-20 10:41:37,671 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-20 10:41:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:37,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:37,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:37,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:41:37,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:37,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:41:37,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:41:37,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:41:37,714 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-01-20 10:41:38,048 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-20 10:41:42,240 WARN L181 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-20 10:41:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:43,047 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-01-20 10:41:43,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:41:43,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:41:43,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:43,050 INFO L225 Difference]: With dead ends: 985 [2019-01-20 10:41:43,050 INFO L226 Difference]: Without dead ends: 984 [2019-01-20 10:41:43,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:41:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-01-20 10:41:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-01-20 10:41:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-01-20 10:41:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-01-20 10:41:43,427 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-01-20 10:41:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:43,427 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-01-20 10:41:43,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:41:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-01-20 10:41:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:43,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:43,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:43,430 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:43,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:43,430 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-01-20 10:41:43,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:43,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:43,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:43,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:43,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:43,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:43,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:43,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:43,528 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-01-20 10:41:43,529 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:43,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:43,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:43,889 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:41:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:43,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:43,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:43,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:43,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:43,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:43,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:43,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:43,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:41:43,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:43,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:43,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:41:44,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:41:44,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:41:44,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:41:44,168 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,252 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:44,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:44,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:44,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:44,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:44,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:41:44,335 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,369 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,390 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,406 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,420 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,432 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:44,479 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:41:44,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:41:44,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:44,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:41:44,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:41:44,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:44,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:41:44,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,706 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:44,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:41:44,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:44,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:41:44,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,803 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:44,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:44,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-20 10:41:44,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:44,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:44,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-20 10:41:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:44,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:45,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:45,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:41:45,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:45,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:41:45,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:41:45,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:41:45,665 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-01-20 10:41:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:49,941 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-01-20 10:41:49,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:41:49,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:41:49,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:49,946 INFO L225 Difference]: With dead ends: 1024 [2019-01-20 10:41:49,946 INFO L226 Difference]: Without dead ends: 1023 [2019-01-20 10:41:49,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:41:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-01-20 10:41:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-01-20 10:41:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-01-20 10:41:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-01-20 10:41:50,327 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-01-20 10:41:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:50,327 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-01-20 10:41:50,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:41:50,327 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-01-20 10:41:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:50,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:50,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:50,329 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:50,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:50,329 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-01-20 10:41:50,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:50,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:50,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:50,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:50,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:50,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:50,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:50,503 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:50,504 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-01-20 10:41:50,504 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:50,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:50,865 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:50,865 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:41:50,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:50,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:50,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:50,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:50,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:50,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:50,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:50,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:50,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:50,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:50,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:50,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:50,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:50,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:41:50,961 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,077 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:41:51,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:41:51,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:41:51,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:41:51,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:41:51,346 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,372 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,426 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,451 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,478 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:51,525 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:41:51,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:41:51,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:51,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:41:51,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:41:51,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:51,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:41:51,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,752 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:51,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:41:51,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:51,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:41:51,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:51,848 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:51,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-20 10:41:51,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:51,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:51,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-20 10:41:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:51,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:52,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:52,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:41:52,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:52,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:41:52,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:41:52,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:41:52,005 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-01-20 10:41:53,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:53,279 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-01-20 10:41:53,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:41:53,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:41:53,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:53,285 INFO L225 Difference]: With dead ends: 1059 [2019-01-20 10:41:53,285 INFO L226 Difference]: Without dead ends: 1057 [2019-01-20 10:41:53,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:41:53,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-01-20 10:41:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-01-20 10:41:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-20 10:41:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-01-20 10:41:53,666 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-01-20 10:41:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:53,666 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-01-20 10:41:53,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:41:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-01-20 10:41:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:53,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:53,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:53,668 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:53,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:53,668 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-01-20 10:41:53,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:53,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:53,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:53,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:53,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:53,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:53,835 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:41:53,835 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-01-20 10:41:53,839 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:41:53,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:41:54,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:41:54,215 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:41:54,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:54,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:41:54,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:54,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:54,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:54,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:41:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:54,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:54,252 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 21 treesize of output 24 [2019-01-20 10:41:54,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:54,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:54,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:54,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:54,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:41:54,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,348 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,381 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:41:54,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:41:54,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:41:54,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:41:54,550 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,567 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,582 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,598 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:54,632 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-20 10:41:54,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:41:54,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:54,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:41:54,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:41:54,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:54,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-20 10:41:54,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,833 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:54,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:41:54,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:54,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-20 10:41:54,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:54,904 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:54,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-20 10:41:54,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:54,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:54,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:41:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:54,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:55,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:55,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:41:55,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:55,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:41:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:41:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:41:55,039 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-01-20 10:41:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:41:57,171 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-01-20 10:41:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:41:57,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:41:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:41:57,176 INFO L225 Difference]: With dead ends: 1044 [2019-01-20 10:41:57,177 INFO L226 Difference]: Without dead ends: 1042 [2019-01-20 10:41:57,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:41:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-01-20 10:41:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-01-20 10:41:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-01-20 10:41:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-01-20 10:41:57,584 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-01-20 10:41:57,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:41:57,584 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-01-20 10:41:57,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:41:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-01-20 10:41:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:41:57,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:41:57,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:41:57,586 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:41:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:41:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-01-20 10:41:57,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:41:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:57,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:41:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:41:57,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:41:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:41:57,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:57,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:57,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:41:57,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:41:57,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:41:57,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:41:57,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:41:57,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:41:57,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:41:57,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:41:57,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:41:57,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:41:57,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,791 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 68 treesize of output 71 [2019-01-20 10:41:57,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:41:57,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:41:57,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:57,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:41:58,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:41:58,013 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:41:58,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:41:58,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:41:58,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:41:58,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:41:58,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:41:58,175 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,211 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,231 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,247 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,261 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,274 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:58,321 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:41:58,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:41:58,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:58,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:41:58,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:41:58,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:58,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:41:58,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,556 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:58,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:41:58,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:58,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-20 10:41:58,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,651 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:41:58,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:41:58,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:41:58,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:41:58,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:41:58,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-20 10:41:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:58,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:41:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:41:58,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:41:58,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:41:58,949 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:41:58,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:41:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:41:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:41:58,950 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-01-20 10:42:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:00,266 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-01-20 10:42:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:42:00,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:42:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:00,271 INFO L225 Difference]: With dead ends: 1044 [2019-01-20 10:42:00,272 INFO L226 Difference]: Without dead ends: 1041 [2019-01-20 10:42:00,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:42:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-01-20 10:42:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-01-20 10:42:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-01-20 10:42:00,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-01-20 10:42:00,684 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-01-20 10:42:00,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:00,684 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-01-20 10:42:00,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:42:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-01-20 10:42:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:00,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:00,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:00,686 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:00,687 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-01-20 10:42:00,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:00,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:42:00,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:00,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:00,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:00,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:00,765 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:42:00,765 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-01-20 10:42:00,765 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:00,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:01,127 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:01,127 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:42:01,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:01,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:01,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:01,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:01,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:01,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:01,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:01,170 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 21 treesize of output 24 [2019-01-20 10:42:01,173 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 24 treesize of output 30 [2019-01-20 10:42:01,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:42:01,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:42:01,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:42:01,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:42:01,220 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,249 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:42:01,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:42:01,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:42:01,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:42:01,526 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,567 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,584 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,599 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:01,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:01,632 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:42:01,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:42:01,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:01,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:42:01,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-20 10:42:01,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:01,974 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:01,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 93 [2019-01-20 10:42:01,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:02,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:02,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2019-01-20 10:42:02,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:02,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-20 10:42:02,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-01-20 10:42:02,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 95 [2019-01-20 10:42:02,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:02,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 93 [2019-01-20 10:42:02,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:02,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2019-01-20 10:42:02,677 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:02,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-01-20 10:42:02,778 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-01-20 10:42:02,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:02,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-20 10:42:02,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:03,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,067 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:03,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 118 [2019-01-20 10:42:03,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-20 10:42:03,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,367 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:03,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 92 [2019-01-20 10:42:03,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:03,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:03,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:03,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 98 [2019-01-20 10:42:03,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:03,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-20 10:42:03,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-01-20 10:42:03,898 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-01-20 10:42:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:03,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:04,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:04,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:42:04,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:04,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:42:04,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:42:04,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:42:04,025 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-01-20 10:42:04,220 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-20 10:42:04,492 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-20 10:42:04,904 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-01-20 10:42:05,369 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-20 10:42:05,824 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-01-20 10:42:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:06,746 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-01-20 10:42:06,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:42:06,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:42:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:06,752 INFO L225 Difference]: With dead ends: 1104 [2019-01-20 10:42:06,752 INFO L226 Difference]: Without dead ends: 1102 [2019-01-20 10:42:06,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:42:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-01-20 10:42:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-01-20 10:42:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-01-20 10:42:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-01-20 10:42:07,200 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-01-20 10:42:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:07,201 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-01-20 10:42:07,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:42:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-01-20 10:42:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:07,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:07,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:07,203 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:07,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:07,203 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-01-20 10:42:07,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:07,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:07,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:07,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:07,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:07,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:07,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:07,301 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:42:07,301 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-01-20 10:42:07,302 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:07,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:07,665 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:07,665 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:42:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:07,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:07,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:07,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:07,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:07,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:07,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:07,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:42:07,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:42:07,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:42:07,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:07,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:42:07,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:07,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:07,903 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:07,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:07,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:42:07,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:42:07,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:42:07,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:42:07,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:42:07,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:42:07,975 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,001 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,022 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,038 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,051 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,064 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:08,097 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:42:08,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:42:08,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:08,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:42:08,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,214 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:08,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:42:08,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:08,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-01-20 10:42:08,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:42:08,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:08,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-20 10:42:08,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,347 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:08,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:08,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-20 10:42:08,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:08,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:08,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-01-20 10:42:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:08,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:08,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:08,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:42:08,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:08,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:42:08,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:42:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:42:08,470 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-01-20 10:42:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:10,883 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-01-20 10:42:10,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:42:10,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:42:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:10,889 INFO L225 Difference]: With dead ends: 1313 [2019-01-20 10:42:10,889 INFO L226 Difference]: Without dead ends: 1312 [2019-01-20 10:42:10,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:42:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-01-20 10:42:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-01-20 10:42:11,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-01-20 10:42:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-01-20 10:42:11,337 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-01-20 10:42:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:11,338 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-01-20 10:42:11,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:42:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-01-20 10:42:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:11,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:11,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:11,339 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-01-20 10:42:11,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:11,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:11,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:11,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:11,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:11,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:11,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:11,411 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:42:11,411 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-01-20 10:42:11,411 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:11,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:11,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:11,714 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:42:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:11,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:11,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:11,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:11,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:11,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:11,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:11,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:42:11,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:42:11,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,746 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 26 treesize of output 36 [2019-01-20 10:42:11,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:42:11,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:42:11,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:11,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:42:11,795 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:12,313 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:12,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:12,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:12,962 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:13,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:13,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 63 treesize of output 56 [2019-01-20 10:42:13,568 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-20 10:42:13,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:42:13,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:42:13,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:42:13,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:42:13,744 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:13,766 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:13,790 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:13,815 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:13,842 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:13,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:13,887 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:42:13,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:42:13,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:13,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:13,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:42:13,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:13,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-20 10:42:14,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:14,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:14,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-20 10:42:14,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:14,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:14,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-20 10:42:14,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:14,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:14,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-20 10:42:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:14,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:14,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:14,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:14,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:42:14,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:14,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:42:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:42:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:42:14,278 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-01-20 10:42:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:15,225 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-01-20 10:42:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:42:15,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:42:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:15,229 INFO L225 Difference]: With dead ends: 881 [2019-01-20 10:42:15,229 INFO L226 Difference]: Without dead ends: 880 [2019-01-20 10:42:15,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:42:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-20 10:42:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-01-20 10:42:15,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-01-20 10:42:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-01-20 10:42:15,671 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-01-20 10:42:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:15,671 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-01-20 10:42:15,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:42:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-01-20 10:42:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:15,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:15,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:15,673 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:15,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:15,673 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-01-20 10:42:15,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:15,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:15,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:15,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:15,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:15,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:15,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:15,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:42:15,772 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-01-20 10:42:15,773 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:15,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:16,053 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:16,053 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:42:16,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:16,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:16,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:16,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:16,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:16,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:16,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:16,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 21 treesize of output 24 [2019-01-20 10:42:16,080 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 24 treesize of output 26 [2019-01-20 10:42:16,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,087 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 26 treesize of output 36 [2019-01-20 10:42:16,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:42:16,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:42:16,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:42:16,133 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,161 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,182 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,212 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:42:16,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:42:16,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:42:16,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:42:16,353 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,366 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,381 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,397 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:16,429 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:42:16,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:42:16,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:16,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:42:16,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:42:16,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:16,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:42:16,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-20 10:42:16,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:16,714 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:16,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:42:16,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:16,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:16,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-20 10:42:16,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:16,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:16,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:16,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:42:16,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:16,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:42:16,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:42:16,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:42:16,801 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-01-20 10:42:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:18,134 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-01-20 10:42:18,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:42:18,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:42:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:18,139 INFO L225 Difference]: With dead ends: 1415 [2019-01-20 10:42:18,139 INFO L226 Difference]: Without dead ends: 1413 [2019-01-20 10:42:18,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:42:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-01-20 10:42:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-01-20 10:42:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-01-20 10:42:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-01-20 10:42:18,883 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-01-20 10:42:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:18,883 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-01-20 10:42:18,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:42:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-01-20 10:42:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:18,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:18,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:18,886 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:18,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:18,886 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-01-20 10:42:18,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:18,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:18,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:18,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:18,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:18,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:18,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:18,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:42:18,958 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-01-20 10:42:18,958 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:18,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:19,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:19,254 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:42:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:19,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:19,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:19,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:19,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:19,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:19,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:19,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:42:19,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:42:19,419 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-20 10:42:19,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:42:19,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:42:19,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,549 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 21 treesize of output 24 [2019-01-20 10:42:19,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:42:19,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:42:19,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:42:19,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:42:19,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:42:19,576 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,602 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,621 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,634 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,646 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,658 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:19,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:19,690 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:42:19,884 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-20 10:42:19,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:19,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:42:19,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-20 10:42:20,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-20 10:42:20,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:389 [2019-01-20 10:42:20,522 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 86 [2019-01-20 10:42:20,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2019-01-20 10:42:20,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:20,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,629 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:20,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 87 [2019-01-20 10:42:20,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:20,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:20,789 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:20,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 93 [2019-01-20 10:42:20,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:20,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-01-20 10:42:20,954 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:186, output treesize:180 [2019-01-20 10:42:21,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 77 [2019-01-20 10:42:21,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:21,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:21,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2019-01-20 10:42:21,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:21,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:21,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-01-20 10:42:21,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:21,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:42:21,252 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-01-20 10:42:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:21,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:21,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:21,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:42:21,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:21,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:42:21,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:42:21,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:42:21,384 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-01-20 10:42:21,819 WARN L181 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-20 10:42:22,640 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-20 10:42:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:23,561 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-01-20 10:42:23,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:42:23,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:42:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:23,568 INFO L225 Difference]: With dead ends: 1381 [2019-01-20 10:42:23,568 INFO L226 Difference]: Without dead ends: 1379 [2019-01-20 10:42:23,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:42:23,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-01-20 10:42:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-01-20 10:42:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-20 10:42:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-20 10:42:24,251 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-20 10:42:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:24,251 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-20 10:42:24,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:42:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-20 10:42:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:24,253 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:24,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:24,254 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:24,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:24,254 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-01-20 10:42:24,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:24,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:24,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:24,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:42:24,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:24,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:24,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:42:24,310 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-01-20 10:42:24,311 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:24,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:24,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:24,821 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:42:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:24,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:24,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:24,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:24,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:24,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:24,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:24,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 63 treesize of output 56 [2019-01-20 10:42:24,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:24,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:24,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:42:24,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:24,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:24,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:24,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:42:25,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:42:25,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:42:25,089 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,115 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:42:25,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:42:25,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:42:25,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:42:25,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, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:42:25,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:42:25,270 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,304 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,324 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,338 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,350 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,362 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:25,406 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:42:25,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:42:25,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:25,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:25,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:42:25,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:25,505 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:25,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 112 [2019-01-20 10:42:25,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:25,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:42:25,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-01-20 10:42:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:25,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:25,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:25,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:42:25,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:25,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:42:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:42:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:42:25,759 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-01-20 10:42:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:26,890 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-01-20 10:42:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:42:26,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:42:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:26,896 INFO L225 Difference]: With dead ends: 1306 [2019-01-20 10:42:26,896 INFO L226 Difference]: Without dead ends: 1305 [2019-01-20 10:42:26,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:42:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-01-20 10:42:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-01-20 10:42:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-20 10:42:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-20 10:42:27,589 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-20 10:42:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:27,589 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-20 10:42:27,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:42:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-20 10:42:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:27,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:27,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:27,592 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:27,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:27,592 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-01-20 10:42:27,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:27,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:27,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:27,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:27,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:27,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:27,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:27,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:42:27,733 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-01-20 10:42:27,735 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:27,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:28,148 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:28,148 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:42:28,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:28,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:28,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:28,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:28,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:28,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:28,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:28,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,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 68 treesize of output 71 [2019-01-20 10:42:28,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,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 58 treesize of output 67 [2019-01-20 10:42:28,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:42:28,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:42:28,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:42:28,427 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:42:28,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:42:28,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:42:28,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:42:28,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:42:28,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:42:28,598 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,633 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,654 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,671 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,685 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:28,744 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:42:28,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:42:28,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:28,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:42:28,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,880 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:28,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-20 10:42:28,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:28,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:28,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:59 [2019-01-20 10:42:28,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:28,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-20 10:42:28,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:29,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:29,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-01-20 10:42:29,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:29,068 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:29,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-20 10:42:29,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:29,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:29,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-20 10:42:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:29,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:29,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:29,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:42:29,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:29,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:42:29,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:42:29,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:42:29,230 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-01-20 10:42:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:30,816 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-01-20 10:42:30,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:42:30,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:42:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:30,823 INFO L225 Difference]: With dead ends: 1360 [2019-01-20 10:42:30,823 INFO L226 Difference]: Without dead ends: 1358 [2019-01-20 10:42:30,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:42:30,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-01-20 10:42:31,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-01-20 10:42:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-01-20 10:42:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-01-20 10:42:31,590 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-01-20 10:42:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:31,591 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-01-20 10:42:31,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:42:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-01-20 10:42:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:31,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:31,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:31,593 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:31,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:31,594 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-01-20 10:42:31,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:31,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:31,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:31,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:42:31,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:31,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:31,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:42:31,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:42:31,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:31,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:31,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:42:31,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:42:31,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:42:31,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:42:31,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:31,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,728 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 68 treesize of output 71 [2019-01-20 10:42:31,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,774 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 58 treesize of output 67 [2019-01-20 10:42:31,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:42:31,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:42:31,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:31,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:42:31,954 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:31,981 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:42:32,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:42:32,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:42:32,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:42:32,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:42:32,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:42:32,502 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,539 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,560 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,577 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,591 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,603 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:32,651 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-20 10:42:32,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:42:32,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:32,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:42:32,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:42:32,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:32,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:42:32,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:32,841 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:32,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:42:32,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:32,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:32,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-20 10:42:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:32,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:32,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:32,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:42:32,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:32,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:42:32,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:42:32,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:42:32,964 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-01-20 10:42:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:34,753 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-01-20 10:42:34,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:42:34,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:42:34,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:34,760 INFO L225 Difference]: With dead ends: 1898 [2019-01-20 10:42:34,760 INFO L226 Difference]: Without dead ends: 1896 [2019-01-20 10:42:34,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:42:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-20 10:42:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-01-20 10:42:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-01-20 10:42:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-01-20 10:42:35,847 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-01-20 10:42:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:35,847 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-01-20 10:42:35,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:42:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-01-20 10:42:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:35,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:35,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:35,852 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-01-20 10:42:35,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:35,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:42:35,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:35,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:42:35,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:42:35,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:42:35,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:42:35,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:42:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:42:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:42:35,938 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-01-20 10:42:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:37,033 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-01-20 10:42:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:42:37,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-20 10:42:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:37,038 INFO L225 Difference]: With dead ends: 1693 [2019-01-20 10:42:37,038 INFO L226 Difference]: Without dead ends: 1692 [2019-01-20 10:42:37,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:42:37,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-01-20 10:42:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-01-20 10:42:38,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-20 10:42:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-01-20 10:42:38,143 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-01-20 10:42:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:38,143 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-01-20 10:42:38,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:42:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-01-20 10:42:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:38,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:38,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:38,147 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-01-20 10:42:38,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:38,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:38,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:38,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:38,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:38,199 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:42:38,199 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-01-20 10:42:38,200 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:38,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:38,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:38,415 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:42:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:38,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:38,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:38,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:38,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:38,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:38,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:38,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:42:38,437 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 24 treesize of output 26 [2019-01-20 10:42:38,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,446 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 26 treesize of output 36 [2019-01-20 10:42:38,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:42:38,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:42:38,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:42:38,495 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,539 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,561 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:42:38,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:42:38,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:42:38,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:42:38,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:42:38,822 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,847 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,871 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,896 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,924 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:38,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:38,969 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-20 10:42:38,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:38,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:42:38,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:39,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:39,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:42:39,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:39,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:39,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:39,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:39,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:39,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:39,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:39,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:39,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 99 [2019-01-20 10:42:39,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:39,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:39,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-01-20 10:42:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:39,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:39,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:39,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:42:39,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:39,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:42:39,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:42:39,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:42:39,162 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-01-20 10:42:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:41,313 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-01-20 10:42:41,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:42:41,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:42:41,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:41,322 INFO L225 Difference]: With dead ends: 2759 [2019-01-20 10:42:41,322 INFO L226 Difference]: Without dead ends: 2757 [2019-01-20 10:42:41,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:42:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-01-20 10:42:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-01-20 10:42:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-01-20 10:42:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-01-20 10:42:43,064 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-01-20 10:42:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:43,065 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-01-20 10:42:43,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:42:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-01-20 10:42:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:43,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:43,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:43,069 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:43,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:43,070 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-01-20 10:42:43,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:43,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:43,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:43,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:43,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:43,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:42:43,206 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-01-20 10:42:43,208 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:42:43,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:42:43,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:42:43,575 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:42:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:43,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:42:43,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:43,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:43,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:43,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:42:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:43,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:43,689 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 21 treesize of output 24 [2019-01-20 10:42:43,692 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 24 treesize of output 30 [2019-01-20 10:42:43,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:42:43,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:42:43,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:42:43,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:42:43,733 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:43,774 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:43,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:43,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:43,833 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:43,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:43,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,883 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 68 treesize of output 71 [2019-01-20 10:42:43,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,925 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 58 treesize of output 67 [2019-01-20 10:42:43,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:43,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:42:44,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:42:44,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:42:44,105 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:44,132 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:44,156 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:44,181 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:44,208 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:44,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:44,255 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:42:44,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:42:44,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:44,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:44,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:42:44,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,377 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:44,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-20 10:42:44,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:44,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:44,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-20 10:42:44,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:42:44,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:44,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:44,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-20 10:42:44,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,548 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:44,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:44,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:42:44,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:44,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:44,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-20 10:42:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:44,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:44,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:44,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:42:44,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:44,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:42:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:42:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:42:44,698 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-01-20 10:42:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:48,266 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-01-20 10:42:48,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:42:48,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:42:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:48,278 INFO L225 Difference]: With dead ends: 3636 [2019-01-20 10:42:48,278 INFO L226 Difference]: Without dead ends: 3626 [2019-01-20 10:42:48,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:42:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-01-20 10:42:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-01-20 10:42:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-01-20 10:42:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-01-20 10:42:50,858 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-01-20 10:42:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:42:50,859 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-01-20 10:42:50,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:42:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-01-20 10:42:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:42:50,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:42:50,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:42:50,864 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:42:50,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:42:50,864 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-01-20 10:42:50,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:42:50,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:50,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:42:50,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:42:50,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:42:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:42:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:50,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:50,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:42:50,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:42:50,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:42:50,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:42:50,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:42:50,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:42:50,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:42:50,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:42:50,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:42:50,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:42:50,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:42:50,982 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 24 treesize of output 26 [2019-01-20 10:42:50,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:50,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:50,988 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 26 treesize of output 36 [2019-01-20 10:42:50,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:50,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:50,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:50,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:42:51,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:42:51,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:42:51,018 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,058 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,082 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:42:51,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:42:51,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:42:51,358 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-01-20 10:42:51,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:42:51,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:42:51,441 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,466 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,490 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,516 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,543 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:51,587 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:42:51,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:42:51,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:51,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:42:51,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:42:51,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:42:51,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:42:51,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-01-20 10:42:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:42:51,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:42:51,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:42:51,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:42:51,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:42:51,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-01-20 10:42:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:52,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:42:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:42:52,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:42:52,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:42:52,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:42:52,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:42:52,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:42:52,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:42:52,048 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-01-20 10:42:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:42:56,205 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-01-20 10:42:56,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:42:56,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:42:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:42:56,219 INFO L225 Difference]: With dead ends: 4300 [2019-01-20 10:42:56,219 INFO L226 Difference]: Without dead ends: 4298 [2019-01-20 10:42:56,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:42:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-01-20 10:43:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-01-20 10:43:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-01-20 10:43:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-01-20 10:43:00,076 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-01-20 10:43:00,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:00,076 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-01-20 10:43:00,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:43:00,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-01-20 10:43:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:43:00,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:00,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:00,082 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-01-20 10:43:00,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:00,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:00,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:43:00,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:00,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:43:00,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:00,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:00,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:43:00,164 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-01-20 10:43:00,165 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:43:00,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:43:00,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:43:00,532 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:43:00,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:00,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:43:00,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:00,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:00,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:00,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:43:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:00,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:00,574 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 21 treesize of output 24 [2019-01-20 10:43:00,577 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 24 treesize of output 30 [2019-01-20 10:43:00,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:43:00,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:43:00,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:43:00,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:43:00,625 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:00,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:00,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:00,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:00,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:00,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:00,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,768 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 68 treesize of output 71 [2019-01-20 10:43:00,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,810 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 58 treesize of output 67 [2019-01-20 10:43:00,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:43:00,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:43:00,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:00,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:43:00,988 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:01,015 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:01,054 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:01,081 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:01,106 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:01,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:01,152 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:43:01,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:43:01,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:01,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:01,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:43:01,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:43:01,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:01,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:01,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-20 10:43:01,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,407 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:01,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-20 10:43:01,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:01,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:01,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-20 10:43:01,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,506 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:01,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:01,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:43:01,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:01,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:01,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-20 10:43:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:01,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:43:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:01,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:43:01,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:43:01,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:43:01,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:43:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:43:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:43:01,661 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-01-20 10:43:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:43:06,061 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-01-20 10:43:06,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:43:06,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:43:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:43:06,077 INFO L225 Difference]: With dead ends: 4236 [2019-01-20 10:43:06,077 INFO L226 Difference]: Without dead ends: 4233 [2019-01-20 10:43:06,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:43:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-01-20 10:43:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-01-20 10:43:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-01-20 10:43:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-01-20 10:43:09,983 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-01-20 10:43:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:09,983 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-01-20 10:43:09,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:43:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-01-20 10:43:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:43:09,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:09,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:09,990 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:09,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-01-20 10:43:09,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:09,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:09,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:43:10,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:10,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:10,090 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:43:10,090 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-01-20 10:43:10,091 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:43:10,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:43:10,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:43:10,441 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:43:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:10,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:43:10,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:10,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:10,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:10,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:43:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:10,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:10,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:43:10,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:43:10,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:43:10,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:43:10,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:43:10,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:43: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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:43:10,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:43:10,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:43:10,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:43:10,726 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,752 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,772 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,788 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,802 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,814 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:10,848 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-20 10:43:10,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:10,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:43:10,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:10,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:10,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:43:11,108 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-20 10:43:11,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:43:11,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:11,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:11,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:43:11,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,195 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:11,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:43:11,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:11,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:11,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-20 10:43:11,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:11,268 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:11,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:43:11,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:11,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:11,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:43:11,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:11,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:43:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:11,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:43:11,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:43:11,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:43:11,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:43:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:43:11,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:43:11,415 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-01-20 10:43:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:43:15,642 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-01-20 10:43:15,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:43:15,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:43:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:43:15,656 INFO L225 Difference]: With dead ends: 4232 [2019-01-20 10:43:15,656 INFO L226 Difference]: Without dead ends: 4231 [2019-01-20 10:43:15,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:43:15,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-01-20 10:43:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-01-20 10:43:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-01-20 10:43:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-01-20 10:43:19,418 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-01-20 10:43:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:19,418 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-01-20 10:43:19,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:43:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-01-20 10:43:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:43:19,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:19,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:19,425 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-01-20 10:43:19,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:19,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:19,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:19,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:19,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:43:19,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:19,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:19,497 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:43:19,497 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-01-20 10:43:19,498 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:43:19,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:43:19,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:43:19,797 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:43:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:19,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:43:19,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:19,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:19,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:19,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:43:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:19,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:19,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:43:19,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:43:19,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:43:19,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:19,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:43:20,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:43:20,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,066 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:43:20,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:43:20,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:43:20,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, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:43:20,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:43:20,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:43:20,275 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,307 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,326 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,341 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,354 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,366 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:20,410 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:43:20,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:43:20,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:20,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:43:20,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:43:20,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:43:20,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:43:20,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:98 [2019-01-20 10:43:20,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,752 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:20,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:20,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:43:20,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:20,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:20,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-20 10:43:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:20,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:43:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:20,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:43:20,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:43:20,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:43:20,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:43:20,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:43:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:43:20,871 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-01-20 10:43:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:43:25,189 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-01-20 10:43:25,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:43:25,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:43:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:43:25,205 INFO L225 Difference]: With dead ends: 4570 [2019-01-20 10:43:25,206 INFO L226 Difference]: Without dead ends: 4569 [2019-01-20 10:43:25,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:43:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-01-20 10:43:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-01-20 10:43:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-01-20 10:43:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-01-20 10:43:29,218 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-01-20 10:43:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:29,218 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-01-20 10:43:29,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:43:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-01-20 10:43:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:43:29,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:29,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:29,226 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:29,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-01-20 10:43:29,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:29,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:29,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:29,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:29,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:43:29,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:29,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:29,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:43:29,458 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-01-20 10:43:29,458 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:43:29,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:43:30,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:43:30,147 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:43:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:30,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:43:30,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:30,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:30,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:30,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:43:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:30,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:30,196 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 21 treesize of output 24 [2019-01-20 10:43:30,199 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 24 treesize of output 30 [2019-01-20 10:43:30,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:43:30,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:43:30,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:43:30,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:43:30,245 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,286 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,330 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:43:30,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:43:30,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:43:30,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:43:30,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:43:30,615 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,640 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,666 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,693 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,720 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:30,767 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:43:30,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:43:30,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:30,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:30,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:43:30,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:30,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:43:30,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:31,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:31,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-20 10:43:31,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,085 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:31,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:43:31,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:31,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:31,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-20 10:43:31,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:31,200 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:31,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 131 [2019-01-20 10:43:31,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:31,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:31,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-20 10:43:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:31,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:43:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:31,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:43:31,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:43:31,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:43:31,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:43:31,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:43:31,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:43:31,394 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-01-20 10:43:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:43:37,556 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-01-20 10:43:37,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:43:37,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:43:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:43:37,577 INFO L225 Difference]: With dead ends: 5928 [2019-01-20 10:43:37,577 INFO L226 Difference]: Without dead ends: 5927 [2019-01-20 10:43:37,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:43:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-01-20 10:43:42,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-01-20 10:43:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-01-20 10:43:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-01-20 10:43:43,018 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-01-20 10:43:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:43,019 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-01-20 10:43:43,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:43:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-01-20 10:43:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:43:43,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:43,026 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:43,026 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:43,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:43,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-01-20 10:43:43,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:43,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:43,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:43,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:43,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:43:43,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:43,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:43,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:43:43,161 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-01-20 10:43:43,162 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:43:43,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:43:43,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:43:43,445 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:43:43,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:43,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:43:43,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:43,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:43,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:43,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:43:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:43,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:43,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:43:43,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:43:43,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:43:43,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:43:43,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:43:43,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:43:43,515 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,548 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,566 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:43:43,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:43:43,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:43:43,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:43:43,740 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,754 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,769 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,785 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:43,817 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-20 10:43:43,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:43:43,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:43,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:43,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:43:43,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:43,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:43:43,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:43:44,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:43:44,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-20 10:43:44,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,095 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:44,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-20 10:43:44,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:44,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:44,165 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:43:44,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-20 10:43:44,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:44,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:43:44,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-20 10:43:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:44,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:43:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:43:44,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:43:44,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:43:44,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:43:44,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:43:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:43:44,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:43:44,331 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-01-20 10:43:44,588 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-01-20 10:43:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:43:51,557 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-01-20 10:43:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:43:51,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:43:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:43:51,579 INFO L225 Difference]: With dead ends: 6511 [2019-01-20 10:43:51,579 INFO L226 Difference]: Without dead ends: 6510 [2019-01-20 10:43:51,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:43:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-20 10:43:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-01-20 10:43:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-01-20 10:43:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-01-20 10:43:58,592 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-01-20 10:43:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:43:58,593 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-01-20 10:43:58,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:43:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-01-20 10:43:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:43:58,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:43:58,601 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:43:58,601 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:43:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-01-20 10:43:58,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:43:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:58,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:43:58,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:43:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:58,742 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-20 10:43:58,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-01-20 10:43:58,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:58,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:43:58,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:43:58,933 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-01-20 10:43:58,933 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:43:58,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:43:59,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:43:59,332 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:43:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:43:59,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:43:59,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:43:59,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:43:59,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:43:59,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:43:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:43:59,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:43:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:43:59,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:43:59,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:43:59,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:43:59,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:43:59,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,583 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:43:59,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:43:59,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:43:59,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:43:59,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:43:59,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:43:59,718 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,751 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,769 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,783 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,794 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,806 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,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-01-20 10:43:59,850 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-01-20 10:43:59,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:43:59,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:43:59,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:43:59,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:43:59,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:43:59,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:43:59,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:00,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:00,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:44:00,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:00,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-20 10:44:00,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:00,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:00,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-20 10:44:00,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:00,144 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:00,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-20 10:44:00,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:00,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:00,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:44:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:00,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:44:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:00,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:44:00,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:44:00,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:44:00,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:44:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:44:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:44:00,307 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-01-20 10:44:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:11,348 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-01-20 10:44:11,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 10:44:11,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-20 10:44:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:11,373 INFO L225 Difference]: With dead ends: 7179 [2019-01-20 10:44:11,373 INFO L226 Difference]: Without dead ends: 7170 [2019-01-20 10:44:11,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:44:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-01-20 10:44:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-01-20 10:44:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-01-20 10:44:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-01-20 10:44:18,535 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-01-20 10:44:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:44:18,535 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-01-20 10:44:18,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:44:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-01-20 10:44:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:44:18,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:44:18,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:44:18,543 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:44:18,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-01-20 10:44:18,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:44:18,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:18,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:18,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:18,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:44:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:18,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:18,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:44:18,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:44:18,599 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-01-20 10:44:18,600 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:44:18,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:44:18,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:44:18,819 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:44:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:18,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:44:18,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:18,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:44:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:18,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:44:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:18,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:44:18,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2019-01-20 10:44:18,842 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 37 treesize of output 36 [2019-01-20 10:44:18,854 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 36 treesize of output 35 [2019-01-20 10:44:18,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-20 10:44:18,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:18,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-01-20 10:44:18,948 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:18,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:18,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,040 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 21 treesize of output 24 [2019-01-20 10:44:19,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:44:19,050 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 26 treesize of output 28 [2019-01-20 10:44:19,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-01-20 10:44:19,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-20 10:44:19,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:44:19,079 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,104 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,115 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,125 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,136 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,146 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:19,178 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-01-20 10:44:19,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:19,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-01-20 10:44:19,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:44:19,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-01-20 10:44:19,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:369 [2019-01-20 10:44:19,694 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 20 [2019-01-20 10:44:19,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:19,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:19,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:19,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:19,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-20 10:44:19,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:19,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:19,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-20 10:44:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:19,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:44:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:19,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:44:19,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:44:19,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:44:19,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:44:19,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:44:19,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:44:19,760 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-01-20 10:44:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:29,875 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-01-20 10:44:29,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:44:29,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:44:29,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:29,917 INFO L225 Difference]: With dead ends: 10441 [2019-01-20 10:44:29,917 INFO L226 Difference]: Without dead ends: 10440 [2019-01-20 10:44:29,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:44:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-01-20 10:44:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-01-20 10:44:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-01-20 10:44:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-01-20 10:44:40,803 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-01-20 10:44:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:44:40,804 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-01-20 10:44:40,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:44:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-01-20 10:44:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:44:40,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:44:40,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:44:40,815 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:44:40,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:40,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-01-20 10:44:40,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:44:40,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:40,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:40,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:44:40,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:44:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:44:40,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:40,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:44:40,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:44:40,921 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-01-20 10:44:40,922 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:44:40,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:44:41,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:44:41,223 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:44:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:44:41,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:44:41,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:44:41,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:44:41,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:44:41,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:44:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:44:41,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:44:41,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:44:41,247 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 24 treesize of output 26 [2019-01-20 10:44:41,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,258 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 26 treesize of output 36 [2019-01-20 10:44:41,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:44:41,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:44:41,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:44:41,310 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,350 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:44:41,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:44:41,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:44:41,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:44:41,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:44:41,631 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,654 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,678 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,703 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,731 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:41,775 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:44:41,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:44:41,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:41,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:44:41,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,889 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:41,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 102 [2019-01-20 10:44:41,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:44:41,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:44:41,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:55 [2019-01-20 10:44:41,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:44:41,980 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:44:41,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 108 [2019-01-20 10:44:41,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:44:42,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:44:42,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:102 [2019-01-20 10:44:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:42,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:44:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:44:42,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:44:42,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:44:42,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:44:42,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:44:42,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:44:42,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:44:42,234 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-01-20 10:44:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:44:52,666 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-01-20 10:44:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:44:52,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:44:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:44:52,709 INFO L225 Difference]: With dead ends: 10427 [2019-01-20 10:44:52,709 INFO L226 Difference]: Without dead ends: 10426 [2019-01-20 10:44:52,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:44:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-01-20 10:45:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-01-20 10:45:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-01-20 10:45:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-01-20 10:45:03,690 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-01-20 10:45:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:03,691 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-01-20 10:45:03,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:45:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-01-20 10:45:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:45:03,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:03,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:45:03,702 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-01-20 10:45:03,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:03,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:03,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:03,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:03,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:03,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:03,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:45:03,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:45:03,782 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-01-20 10:45:03,782 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:45:03,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:45:04,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:45:04,304 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:45:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:04,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:45:04,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:04,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:45:04,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:04,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:45:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:04,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:45:04,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:45:04,327 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 24 treesize of output 26 [2019-01-20 10:45:04,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,341 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 26 treesize of output 36 [2019-01-20 10:45:04,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:45:04,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:45:04,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:45:04,372 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,403 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:45:04,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:45:04,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:45:04,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:45:04,595 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,609 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,623 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,640 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:04,672 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-20 10:45:04,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:45:04,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:04,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:45:04,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,772 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:04,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-20 10:45:04,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:04,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-20 10:45:04,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-20 10:45:04,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:04,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:45:04,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:04,872 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:04,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-20 10:45:04,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:04,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:04,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:45:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:04,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:45:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:04,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:45:04,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:45:04,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:45:04,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:45:04,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:45:04,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:45:04,989 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-01-20 10:45:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:45:16,254 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-01-20 10:45:16,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:45:16,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:45:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:45:16,299 INFO L225 Difference]: With dead ends: 11408 [2019-01-20 10:45:16,299 INFO L226 Difference]: Without dead ends: 11406 [2019-01-20 10:45:16,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:45:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-01-20 10:45:27,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-01-20 10:45:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-01-20 10:45:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-01-20 10:45:27,644 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-01-20 10:45:27,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:27,644 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-01-20 10:45:27,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:45:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-01-20 10:45:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:45:27,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:27,656 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:45:27,656 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:27,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:27,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-01-20 10:45:27,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:27,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:27,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:27,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:27,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:27,848 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 18 [2019-01-20 10:45:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:45:27,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:27,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:45:27,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:45:27,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:45:27,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:27,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:45:27,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:45:27,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:45:27,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:45:27,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:45:27,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:45:27,979 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 21 treesize of output 24 [2019-01-20 10:45:27,997 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 24 treesize of output 30 [2019-01-20 10:45:28,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:45:28,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:45:28,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,238 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-20 10:45:28,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:45:28,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:45:28,297 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:45:28,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:45:28,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:45:28,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:45:28,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:45:28,667 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,692 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,719 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,746 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:28,820 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:45:28,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:45:28,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:28,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:45:28,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:28,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:45:28,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:28,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:28,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-20 10:45:29,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,106 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:29,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-20 10:45:29,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:29,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:29,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-01-20 10:45:29,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,201 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:29,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:45:29,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:29,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:29,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2019-01-20 10:45:29,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:29,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 125 [2019-01-20 10:45:29,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:29,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:29,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-01-20 10:45:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:29,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:45:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:29,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:45:29,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-20 10:45:29,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:45:29,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:45:29,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:45:29,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:45:29,482 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-01-20 10:45:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:45:44,613 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-01-20 10:45:44,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:45:44,614 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-20 10:45:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:45:44,673 INFO L225 Difference]: With dead ends: 14692 [2019-01-20 10:45:44,673 INFO L226 Difference]: Without dead ends: 14688 [2019-01-20 10:45:44,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:45:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-01-20 10:45:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-01-20 10:45:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-01-20 10:45:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-01-20 10:45:58,653 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-01-20 10:45:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:45:58,653 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-01-20 10:45:58,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:45:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-01-20 10:45:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:45:58,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:45:58,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:45:58,665 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:45:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:58,666 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-01-20 10:45:58,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:45:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:58,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:45:58,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:45:58,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:45:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:58,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:58,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:45:58,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:45:58,725 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-01-20 10:45:58,726 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:45:58,726 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:45:59,034 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:45:59,034 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:45:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:45:59,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:45:59,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:45:59,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:45:59,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:45:59,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:45:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:45:59,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:45:59,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:45:59,077 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 24 treesize of output 26 [2019-01-20 10:45:59,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,089 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 26 treesize of output 36 [2019-01-20 10:45:59,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:45:59,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:45:59,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:45:59,131 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,197 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,225 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:45:59,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:45:59,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:45:59,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:45:59,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:45:59,451 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,474 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,499 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,522 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,549 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:59,594 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:45:59,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-01-20 10:45:59,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:59,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-20 10:45:59,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 109 [2019-01-20 10:45:59,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:59,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-20 10:45:59,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,847 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:45:59,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:45:59,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:45:59,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:45:59,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:45:59,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-20 10:45:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:59,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:45:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:45:59,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:45:59,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:45:59,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:45:59,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:45:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:45:59,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:45:59,968 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-01-20 10:46:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:46:14,464 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-01-20 10:46:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:46:14,465 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:46:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:46:14,514 INFO L225 Difference]: With dead ends: 13016 [2019-01-20 10:46:14,514 INFO L226 Difference]: Without dead ends: 13015 [2019-01-20 10:46:14,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:46:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-01-20 10:46:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-01-20 10:46:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-20 10:46:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-20 10:46:28,386 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-20 10:46:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:46:28,386 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-20 10:46:28,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:46:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-20 10:46:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:46:28,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:46:28,400 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:46:28,400 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:46:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:28,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-01-20 10:46:28,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:46:28,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:28,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:28,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:28,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:46:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:46:28,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:28,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:46:28,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:46:28,461 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-01-20 10:46:28,461 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:46:28,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:46:28,616 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:46:28,617 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:46:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:28,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:46:28,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:28,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:46:28,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:28,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:46:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:28,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:46:28,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:46:28,640 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 24 treesize of output 26 [2019-01-20 10:46:28,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,651 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 26 treesize of output 36 [2019-01-20 10:46:28,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:46:28,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:46:28,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:46:28,693 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,721 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:46:28,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:46:28,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:46:28,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:28,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:46:28,910 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,925 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,940 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:28,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:28,988 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-20 10:46:29,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:29,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:46:29,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:46:29,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:46:29,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-20 10:46:29,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:29,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:29,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:29,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:29,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:29,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:29,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:46:29,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:29,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:29,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2019-01-20 10:46:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:29,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:46:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:29,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:46:29,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:46:29,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:46:29,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:46:29,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:46:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:46:29,251 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-01-20 10:46:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:46:42,056 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-01-20 10:46:42,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:46:42,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 10:46:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:46:42,109 INFO L225 Difference]: With dead ends: 12974 [2019-01-20 10:46:42,109 INFO L226 Difference]: Without dead ends: 12973 [2019-01-20 10:46:42,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:46:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-01-20 10:46:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-01-20 10:46:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-20 10:46:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-20 10:46:55,986 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-20 10:46:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:46:55,986 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-20 10:46:55,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:46:55,986 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-20 10:46:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:46:55,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:46:55,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:46:55,997 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:46:55,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-01-20 10:46:55,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:46:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:46:55,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:46:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:56,180 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:46:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:46:56,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:56,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:46:56,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:46:56,366 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-01-20 10:46:56,367 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:46:56,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:46:56,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:46:56,668 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:46:56,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:46:56,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:46:56,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:46:56,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:46:56,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:46:56,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:46:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:46:56,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:46:56,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:46:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:46:56,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:46:56,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:46:56,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:46:56,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:46:56,750 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:56,788 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:56,810 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:56,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:56,840 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:56,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:56,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:46:56,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:46:56,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:46:56,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:56,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:46:57,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:46:57,071 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:57,094 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:57,118 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:57,143 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:57,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:46:57,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:57,215 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:46:57,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:46:57,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:46:57,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:46:57,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-20 10:46:57,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,467 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:46:57,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:46:57,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:57,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:57,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-20 10:46:57,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:46:57,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:46:57,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:46:57,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:46:57,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-20 10:46:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:57,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:46:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:46:57,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:46:57,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:46:57,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:46:57,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:46:57,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:46:57,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:46:57,650 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-01-20 10:47:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:47:10,942 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-01-20 10:47:10,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:47:10,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:47:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:47:10,994 INFO L225 Difference]: With dead ends: 13106 [2019-01-20 10:47:10,994 INFO L226 Difference]: Without dead ends: 13105 [2019-01-20 10:47:10,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:47:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-01-20 10:47:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-01-20 10:47:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-01-20 10:47:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-01-20 10:47:25,887 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-01-20 10:47:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:47:25,887 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-01-20 10:47:25,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:47:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-01-20 10:47:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:47:25,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:47:25,899 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:47:25,900 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:47:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-01-20 10:47:25,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:47:25,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:25,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:25,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:25,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:47:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:47:25,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:25,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:47:25,998 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:47:25,998 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-01-20 10:47:25,999 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:47:25,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:47:26,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:47:26,361 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:47:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:26,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:47:26,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:26,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:47:26,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:26,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:47:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:26,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:47: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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:47:26,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:47:26,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:47:26,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:47:26,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:47:26,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:47:26,452 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,493 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,516 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,550 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,599 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 68 treesize of output 71 [2019-01-20 10:47:26,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:47:26,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:47:26,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:47:26,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:26,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:47:26,819 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,844 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,870 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,897 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,924 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:26,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:26,972 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:47:27,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:47:27,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:27,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:27,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:47:27,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,110 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:47:27,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-20 10:47:27,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:27,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-01-20 10:47:27,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-20 10:47:27,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:47:27,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:27,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:27,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-20 10:47:27,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:27,299 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:47:27,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:47:27,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:27,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:27,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-20 10:47:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:27,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:47:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:27,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:47:27,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:47:27,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:47:27,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:47:27,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:47:27,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:47:27,474 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-01-20 10:47:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:47:41,390 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-01-20 10:47:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:47:41,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:47:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:47:41,440 INFO L225 Difference]: With dead ends: 13278 [2019-01-20 10:47:41,441 INFO L226 Difference]: Without dead ends: 13277 [2019-01-20 10:47:41,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:47:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-01-20 10:47:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-01-20 10:47:55,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-01-20 10:47:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-01-20 10:47:55,520 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-01-20 10:47:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:47:55,521 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-01-20 10:47:55,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:47:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-01-20 10:47:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:47:55,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:47:55,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:47:55,533 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:47:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-01-20 10:47:55,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:47:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:55,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:47:55,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:47:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:55,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:55,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:47:55,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:47:55,692 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-01-20 10:47:55,693 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:47:55,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:47:57,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:47:57,060 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:47:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:47:57,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:47:57,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:47:57,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:47:57,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:47:57,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:47:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:47:57,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:47:57,108 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 21 treesize of output 24 [2019-01-20 10:47:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:47:57,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:47:57,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:47:57,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:47:57,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:47:57,151 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,181 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,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 48 treesize of output 54 [2019-01-20 10:47:57,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:47:57,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:47:57,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:47:57,402 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,419 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,435 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,452 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:57,486 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:47:57,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:47:57,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,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-01-20 10:47:57,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:47:57,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,604 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:47:57,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:47:57,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,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-01-20 10:47:57,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-20 10:47:57,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:47:57,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:57,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-20 10:47:57,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:47:57,741 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:47:57,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:47:57,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:47:57,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:47:57,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:47:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:57,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:47:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:47:57,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:47:57,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:47:57,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:47:57,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:47:57,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:47:57,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:47:57,876 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-01-20 10:48:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:48:14,469 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-01-20 10:48:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:48:14,470 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-20 10:48:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:48:14,544 INFO L225 Difference]: With dead ends: 17581 [2019-01-20 10:48:14,544 INFO L226 Difference]: Without dead ends: 17580 [2019-01-20 10:48:14,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:48:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-01-20 10:48:25,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-01-20 10:48:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-20 10:48:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-20 10:48:25,538 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-20 10:48:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:48:25,538 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-20 10:48:25,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:48:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-20 10:48:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:48:25,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:48:25,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:48:25,547 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:48:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:48:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-01-20 10:48:25,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:48:25,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:48:25,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:48:25,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:48:25,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:48:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:48:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:48:25,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:48:25,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:48:25,653 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:48:25,653 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-01-20 10:48:25,653 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:48:25,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:48:25,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:48:25,871 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:48:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:48:25,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:48:25,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:48:25,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:48:25,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:48:25,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:48:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:48:25,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:48:25,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:48:25,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:48:25,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:48:25,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:48:25,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:48:25,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:25,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:48:25,948 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:25,986 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:48:26,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:48:26,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:48:26,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:48:26,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:48:26,260 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,285 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,310 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,333 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,361 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:48:26,406 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:48:26,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:48:26,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:48:26,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:26,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-20 10:48:26,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:26,654 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:26,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:48:26,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:26,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:48:26,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-01-20 10:48:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:48:26,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:48:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:48:27,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:48:27,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:48:27,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:48:27,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:48:27,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:48:27,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:48:27,037 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-01-20 10:48:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:48:37,723 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-01-20 10:48:37,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:48:37,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:48:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:48:37,760 INFO L225 Difference]: With dead ends: 9947 [2019-01-20 10:48:37,760 INFO L226 Difference]: Without dead ends: 9946 [2019-01-20 10:48:37,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:48:37,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-01-20 10:48:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-01-20 10:48:48,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-20 10:48:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-20 10:48:48,502 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-20 10:48:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:48:48,502 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-20 10:48:48,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:48:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-20 10:48:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:48:48,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:48:48,511 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:48:48,511 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:48:48,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:48:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-01-20 10:48:48,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:48:48,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:48:48,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:48:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:48:48,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:48:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:48:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:48:48,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:48:48,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:48:48,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:48:48,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:48:48,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:48:48,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:48:48,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:48:48,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:48:48,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:48:48,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:48:48,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:48:48,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:48:48,649 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 24 treesize of output 30 [2019-01-20 10:48:48,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:48:48,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:48:48,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:48:48,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-20 10:48:48,678 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,728 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:48:48,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:48:48,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:48:48,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:48,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:48:48,922 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,938 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,954 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:48,971 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:48:49,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:48:49,003 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-20 10:48:49,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-20 10:48:49,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:48:49,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-20 10:48:49,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-01-20 10:48:49,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,338 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:49,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-20 10:48:49,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:49,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-20 10:48:49,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-20 10:48:49,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-01-20 10:48:49,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-01-20 10:48:49,923 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-01-20 10:48:49,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:49,940 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:49,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2019-01-20 10:48:49,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:50,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:48:50,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:50,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,237 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:50,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 113 [2019-01-20 10:48:50,238 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:50,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2019-01-20 10:48:50,367 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:50,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-20 10:48:50,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-01-20 10:48:50,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 78 [2019-01-20 10:48:50,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:50,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:48:50,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:50,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 108 [2019-01-20 10:48:50,800 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:50,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:50,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 100 [2019-01-20 10:48:50,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:51,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-20 10:48:51,036 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-01-20 10:48:51,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:51,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 123 [2019-01-20 10:48:51,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:51,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 118 [2019-01-20 10:48:51,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:51,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,427 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:48:51,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 125 [2019-01-20 10:48:51,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:51,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:48:51,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-20 10:48:51,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:48:51,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-20 10:48:51,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:141 [2019-01-20 10:48:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:48:51,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:48:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:48:51,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:48:51,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-20 10:48:51,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:48:51,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:48:51,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:48:51,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:48:51,920 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-01-20 10:48:52,126 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-20 10:48:52,411 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-01-20 10:48:52,710 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-01-20 10:48:54,025 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-01-20 10:48:55,551 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-01-20 10:49:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:49:07,951 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-01-20 10:49:07,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 10:49:07,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-20 10:49:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:49:08,000 INFO L225 Difference]: With dead ends: 12394 [2019-01-20 10:49:08,001 INFO L226 Difference]: Without dead ends: 12392 [2019-01-20 10:49:08,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-01-20 10:49:08,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-01-20 10:49:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-01-20 10:49:17,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-01-20 10:49:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-01-20 10:49:17,433 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-01-20 10:49:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:49:17,433 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-01-20 10:49:17,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:49:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-01-20 10:49:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:49:17,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:49:17,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:49:17,443 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:49:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:17,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-01-20 10:49:17,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:49:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:17,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:49:17,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:17,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:49:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:49:17,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:17,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:49:17,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:49:17,531 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-01-20 10:49:17,532 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:49:17,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:49:17,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:49:17,880 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:49:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:17,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:49:17,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:17,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:49:17,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:49:17,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:49:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:17,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:49:17,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:49:17,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:49:17,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,912 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 26 treesize of output 36 [2019-01-20 10:49:17,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:49:17,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:49:17,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:17,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:49:17,950 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:17,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,010 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:49:18,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:49:18,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:49:18,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:49:18,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:49:18,268 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,291 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,316 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,341 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:18,412 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:49:18,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:49:18,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:49:18,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:49:18,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-20 10:49:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 90 [2019-01-20 10:49:18,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 127 [2019-01-20 10:49:18,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:18,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:49:18,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:94 [2019-01-20 10:49:18,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:18,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:18,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-20 10:49:18,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:19,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,048 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:19,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:19,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 138 [2019-01-20 10:49:19,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:19,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:49:19,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:100 [2019-01-20 10:49:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:19,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:49:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:19,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:49:19,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:49:19,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:49:19,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:49:19,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:49:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:49:19,276 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-01-20 10:49:19,478 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-20 10:49:21,316 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-01-20 10:49:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:49:29,557 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-01-20 10:49:29,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:49:29,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:49:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:49:29,584 INFO L225 Difference]: With dead ends: 7367 [2019-01-20 10:49:29,584 INFO L226 Difference]: Without dead ends: 7366 [2019-01-20 10:49:29,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:49:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-01-20 10:49:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-01-20 10:49:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-01-20 10:49:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-01-20 10:49:39,726 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-01-20 10:49:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:49:39,726 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-01-20 10:49:39,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:49:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-01-20 10:49:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:49:39,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:49:39,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:49:39,733 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:49:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:49:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-01-20 10:49:39,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:49:39,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:39,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:49:39,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:49:39,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:49:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:49:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:49:39,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:39,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:49:39,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:49:39,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:49:39,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:49:39,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:49:39,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:49:39,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:49:39,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:49:39,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:49:39,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:49:39,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:49:39,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:49:39,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:49:39,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:49:39,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:49:39,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:39,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:49:39,961 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,062 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,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 68 treesize of output 71 [2019-01-20 10:49:40,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,154 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 58 treesize of output 67 [2019-01-20 10:49:40,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:49:40,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:49:40,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:49:40,331 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,356 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,382 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,409 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,436 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:40,484 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-20 10:49:40,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:49:40,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:40,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:49:40,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:49:40,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:40,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-20 10:49:40,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,708 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:40,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:49:40,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:40,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-20 10:49:40,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:49:40,800 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:49:40,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-20 10:49:40,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:49:40,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:49:40,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-20 10:49:40,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-01-20 10:49:40,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:49:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:49:40,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:49:40,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:49:40,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:49:40,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:49:40,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:49:40,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:49:40,944 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-01-20 10:49:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:49:57,537 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-01-20 10:49:57,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:49:57,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:49:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:49:57,577 INFO L225 Difference]: With dead ends: 9936 [2019-01-20 10:49:57,577 INFO L226 Difference]: Without dead ends: 9935 [2019-01-20 10:49:57,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:49:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-01-20 10:50:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-01-20 10:50:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-01-20 10:50:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-01-20 10:50:12,146 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-01-20 10:50:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:50:12,146 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-01-20 10:50:12,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:50:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-01-20 10:50:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:50:12,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:50:12,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:50:12,155 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:50:12,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:50:12,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-01-20 10:50:12,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:50:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:50:12,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:50:12,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:50:12,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:50:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:50:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:50:12,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:50:12,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:50:12,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:50:12,278 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-01-20 10:50:12,279 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:50:12,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:50:12,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:50:12,579 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:50:12,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:50:12,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:50:12,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:50:12,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:50:12,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:50:12,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:50:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:50:12,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:50:12,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:50:12,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:50:12,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:50:12,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:50:12,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:12,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:50:12,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:50:12,831 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:12,857 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:12,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:12,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:12,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:50:12,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:50:12,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:50:12,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:50:12,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:50:12,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:50:12,962 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:50:12,994 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:13,012 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:13,027 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:13,039 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:13,052 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:13,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:50:13,096 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-20 10:50:13,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:50:13,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:50:13,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:50:13,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-20 10:50:13,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,336 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:50:13,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:50:13,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:50:13,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:50:13,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-20 10:50:13,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:13,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:50:13,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:50:13,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:50:13,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-20 10:50:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:50:13,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:50:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:50:13,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:50:13,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:50:13,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:50:13,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:50:13,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:50:13,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:50:13,499 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-01-20 10:50:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:50:28,611 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-01-20 10:50:28,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:50:28,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:50:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:50:28,646 INFO L225 Difference]: With dead ends: 9235 [2019-01-20 10:50:28,646 INFO L226 Difference]: Without dead ends: 9232 [2019-01-20 10:50:28,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:50:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-01-20 10:50:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-01-20 10:50:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-01-20 10:50:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-01-20 10:50:44,696 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-01-20 10:50:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:50:44,696 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-01-20 10:50:44,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:50:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-01-20 10:50:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:50:44,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:50:44,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:50:44,705 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:50:44,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:50:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-01-20 10:50:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:50:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:50:44,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:50:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:50:44,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:50:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:50:44,895 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-20 10:50:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:50:44,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:50:44,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:50:44,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:50:44,924 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-01-20 10:50:44,926 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:50:44,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:50:45,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:50:45,143 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:50:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:50:45,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:50:45,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:50:45,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:50:45,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:50:45,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:50:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:50:45,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:50:45,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:50:45,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:50:45,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:50:45,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:50:45,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:50:45,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:50:45,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:50:45,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:50:45,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:50:45,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-20 10:50:45,372 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,398 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,417 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,432 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,444 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,456 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:50:45,488 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-20 10:50:45,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:50:45,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:50:45,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:50:45,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-20 10:50:45,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:50:45,679 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:50:45,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:50:45,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:50:45,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:50:45,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-01-20 10:50:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:50:46,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:50:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:50:46,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:50:46,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:50:46,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:50:46,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:50:46,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:50:46,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:50:46,060 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-01-20 10:51:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:51:00,216 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-01-20 10:51:00,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:51:00,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:51:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:51:00,252 INFO L225 Difference]: With dead ends: 9065 [2019-01-20 10:51:00,252 INFO L226 Difference]: Without dead ends: 9064 [2019-01-20 10:51:00,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:51:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-01-20 10:51:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-01-20 10:51:15,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-01-20 10:51:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-01-20 10:51:15,483 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-01-20 10:51:15,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:51:15,483 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-01-20 10:51:15,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:51:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-01-20 10:51:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:51:15,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:51:15,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:51:15,493 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:51:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:51:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-01-20 10:51:15,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:51:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:51:15,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:51:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:51:15,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:51:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:51:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:51:15,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:51:15,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:51:15,585 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:51:15,586 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-01-20 10:51:15,587 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:51:15,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:51:16,022 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:51:16,022 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-20 10:51:16,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:51:16,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:51:16,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:51:16,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:51:16,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:51:16,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:51:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:51:16,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:51:16,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:51:16,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,115 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 58 treesize of output 67 [2019-01-20 10:51:16,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:51:16,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:51:16,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:51:16,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:51:16,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:51:16,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:51:16,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:51:16,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:51:16,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:51:16,495 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,532 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,553 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,569 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,583 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,595 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,642 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-01-20 10:51:16,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:51:16,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:16,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-01-20 10:51:16,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:51:16,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:16,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-01-20 10:51:16,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,903 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:51:16,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:51:16,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:16,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:16,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:47 [2019-01-20 10:51:16,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:16,998 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:51:16,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 124 [2019-01-20 10:51:17,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:17,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:17,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:49 [2019-01-20 10:51:17,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:17,101 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:51:17,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 127 [2019-01-20 10:51:17,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:17,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:17,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-01-20 10:51:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:51:17,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:51:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:51:17,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:51:17,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 10:51:17,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:51:17,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:51:17,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:51:17,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:51:17,298 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-01-20 10:51:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:51:37,446 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-01-20 10:51:37,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:51:37,447 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-20 10:51:37,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:51:37,484 INFO L225 Difference]: With dead ends: 9411 [2019-01-20 10:51:37,484 INFO L226 Difference]: Without dead ends: 9409 [2019-01-20 10:51:37,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-01-20 10:51:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-01-20 10:51:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-01-20 10:51:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-01-20 10:51:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-01-20 10:51:52,663 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-01-20 10:51:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:51:52,663 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-01-20 10:51:52,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:51:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-01-20 10:51:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:51:52,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:51:52,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:51:52,673 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:51:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:51:52,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-01-20 10:51:52,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:51:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:51:52,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:51:52,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:51:52,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:51:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:51:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:51:52,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:51:52,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:51:52,825 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:51:52,825 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-01-20 10:51:52,826 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:51:52,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:51:53,290 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:51:53,290 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-20 10:51:53,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:51:53,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:51:53,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:51:53,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:51:53,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:51:53,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:51:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:51:53,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:51:53,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,330 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 68 treesize of output 71 [2019-01-20 10:51:53,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:51:53,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:51:53,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:51:53,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:51:53,551 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:51:53,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-20 10:51:53,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:51:53,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-20 10:51:53,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-20 10:51:53,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-20 10:51:53,711 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,747 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,768 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,798 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,811 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:53,858 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-20 10:51:53,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:51:53,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:53,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:53,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-20 10:51:53,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:53,996 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:51:53,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-20 10:51:53,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:54,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:54,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-01-20 10:51:54,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:51:54,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:54,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:54,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-01-20 10:51:54,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,186 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:51:54,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 124 [2019-01-20 10:51:54,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:54,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:54,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-01-20 10:51:54,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,282 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:51:54,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:51:54,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 120 [2019-01-20 10:51:54,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:51:54,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:51:54,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:49 [2019-01-20 10:51:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:51:54,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:51:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:51:54,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:51:54,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 10:51:54,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:51:54,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:51:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:51:54,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:51:54,472 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states. [2019-01-20 10:52:11,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:52:11,028 INFO L93 Difference]: Finished difference Result 8797 states and 61626 transitions. [2019-01-20 10:52:11,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:52:11,029 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-20 10:52:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:52:11,060 INFO L225 Difference]: With dead ends: 8797 [2019-01-20 10:52:11,060 INFO L226 Difference]: Without dead ends: 8791 [2019-01-20 10:52:11,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:52:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2019-01-20 10:52:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 1900. [2019-01-20 10:52:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-01-20 10:52:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 13072 transitions. [2019-01-20 10:52:19,937 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 13072 transitions. Word has length 7 [2019-01-20 10:52:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:52:19,937 INFO L480 AbstractCegarLoop]: Abstraction has 1900 states and 13072 transitions. [2019-01-20 10:52:19,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:52:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 13072 transitions. [2019-01-20 10:52:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:52:19,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:52:19,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:52:19,941 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:52:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:52:19,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-01-20 10:52:19,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:52:19,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:52:19,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:52:19,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:52:19,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:52:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:52:19,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:52:19,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:52:19,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:52:19,994 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:52:19,994 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [30], [31] [2019-01-20 10:52:19,995 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:52:19,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:52:20,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:52:20,309 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:52:20,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:52:20,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:52:20,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:52:20,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:52:20,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:52:20,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:52:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:52:20,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:52:20,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-20 10:52:20,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-20 10:52:20,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-20 10:52:20,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-20 10:52:20,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:52:20,531 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,557 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-20 10:52:20,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-20 10:52:20,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-20 10:52:20,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:52:20,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-20 10:52:20,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-20 10:52:20,691 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,724 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,743 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,758 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,786 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:52:20,830 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-20 10:52:20,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-20 10:52:20,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:52:20,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-20 10:52:20,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:20,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-20 10:52:20,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:52:20,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:52:20,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-20 10:52:21,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:52:21,034 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:52:21,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 134 [2019-01-20 10:52:21,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:52:21,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:52:21,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:90 [2019-01-20 10:52:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:52:21,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:52:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:52:21,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:52:21,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:52:21,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:52:21,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:52:21,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:52:21,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:52:21,312 INFO L87 Difference]: Start difference. First operand 1900 states and 13072 transitions. Second operand 10 states. [2019-01-20 10:52:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:52:31,459 INFO L93 Difference]: Finished difference Result 1963 states and 13288 transitions. [2019-01-20 10:52:31,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:52:31,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:52:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:52:31,465 INFO L225 Difference]: With dead ends: 1963 [2019-01-20 10:52:31,466 INFO L226 Difference]: Without dead ends: 1962 [2019-01-20 10:52:31,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:52:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states.