java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:36:59,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:36:59,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:36:59,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:36:59,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:36:59,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:36:59,374 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:36:59,376 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:36:59,377 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:36:59,378 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:36:59,379 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:36:59,379 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:36:59,380 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:36:59,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:36:59,383 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:36:59,383 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:36:59,384 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:36:59,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:36:59,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:36:59,390 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:36:59,391 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:36:59,393 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:36:59,395 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:36:59,395 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:36:59,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:36:59,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:36:59,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:36:59,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:36:59,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:36:59,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:36:59,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:36:59,402 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:36:59,402 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:36:59,402 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:36:59,404 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:36:59,404 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:36:59,405 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-07 21:36:59,424 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:36:59,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:36:59,426 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:36:59,426 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:36:59,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:36:59,426 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:36:59,427 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:36:59,427 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:36:59,427 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:36:59,427 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:36:59,427 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:36:59,428 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:36:59,428 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:36:59,428 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:36:59,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:36:59,429 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:36:59,429 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:36:59,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:36:59,431 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:36:59,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:36:59,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:36:59,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:36:59,431 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:36:59,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:36:59,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:36:59,432 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:36:59,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:36:59,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:36:59,434 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:36:59,434 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:36:59,434 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:36:59,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:36:59,435 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:36:59,435 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:36:59,435 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:36:59,435 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:36:59,436 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:36:59,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:36:59,436 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:36:59,436 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:36:59,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:36:59,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:36:59,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:36:59,509 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:36:59,510 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:36:59,511 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-01-07 21:36:59,511 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-01-07 21:36:59,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:36:59,564 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:36:59,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:36:59,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:36:59,565 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:36:59,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/1) ... [2019-01-07 21:36:59,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/1) ... [2019-01-07 21:36:59,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:36:59,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:36:59,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:36:59,634 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:36:59,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/1) ... [2019-01-07 21:36:59,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/1) ... [2019-01-07 21:36:59,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/1) ... [2019-01-07 21:36:59,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/1) ... [2019-01-07 21:36:59,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/1) ... [2019-01-07 21:36:59,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/1) ... [2019-01-07 21:36:59,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/1) ... [2019-01-07 21:36:59,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:36:59,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:36:59,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:36:59,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:36:59,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (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-07 21:36:59,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:36:59,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:37:00,022 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:37:00,023 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-07 21:37:00,026 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:37:00 BoogieIcfgContainer [2019-01-07 21:37:00,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:37:00,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:37:00,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:37:00,035 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:37:00,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:36:59" (1/2) ... [2019-01-07 21:37:00,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23925a96 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:37:00, skipping insertion in model container [2019-01-07 21:37:00,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:37:00" (2/2) ... [2019-01-07 21:37:00,039 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-01-07 21:37:00,052 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:37:00,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-07 21:37:00,100 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-07 21:37:00,149 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:37:00,149 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:37:00,150 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:37:00,150 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:37:00,150 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:37:00,150 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:37:00,151 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:37:00,151 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:37:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-07 21:37:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 21:37:00,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:00,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 21:37:00,179 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:00,189 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-07 21:37:00,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:00,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:00,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:00,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:00,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:00,391 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-07 21:37:00,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:37:00,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:37:00,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:37:00,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:37:00,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:37:00,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:37:00,413 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-07 21:37:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:00,626 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-07 21:37:00,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:37:00,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 21:37:00,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:00,642 INFO L225 Difference]: With dead ends: 25 [2019-01-07 21:37:00,643 INFO L226 Difference]: Without dead ends: 20 [2019-01-07 21:37:00,646 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-07 21:37:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-07 21:37:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-07 21:37:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 21:37:00,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-07 21:37:00,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-07 21:37:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:00,686 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-07 21:37:00,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:37:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-07 21:37:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:37:00,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:00,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:37:00,688 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-07 21:37:00,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:00,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:00,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:00,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:00,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:00,986 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-07 21:37:01,008 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-07 21:37:01,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:01,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:01,010 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:37:01,012 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-07 21:37:01,051 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:01,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:01,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:01,130 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:01,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:01,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:01,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:01,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:01,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:01,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:01,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:01,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:01,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:01,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:01,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:01,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:01,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:01,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:01,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:01,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:01,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:02,024 INFO L267 ElimStorePlain]: Start 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-07 21:37:02,025 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:02,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:02,188 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-07 21:37:02,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:02,262 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-07 21:37:02,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:02,296 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-07 21:37:02,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:02,415 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-07 21:37:02,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:02,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:37:02,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:02,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:37:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:37:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:02,439 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-07 21:37:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:03,186 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-07 21:37:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:37:03,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:37:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:03,189 INFO L225 Difference]: With dead ends: 39 [2019-01-07 21:37:03,189 INFO L226 Difference]: Without dead ends: 37 [2019-01-07 21:37:03,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:37:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-07 21:37:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-07 21:37:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 21:37:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-07 21:37:03,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-07 21:37:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:03,198 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-07 21:37:03,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:37:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-07 21:37:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:37:03,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:03,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:37:03,199 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:03,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:03,200 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-07 21:37:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:03,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:03,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:03,323 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-07 21:37:03,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:03,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:03,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:37:03,324 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-07 21:37:03,325 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:03,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:03,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:03,335 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:03,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:03,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:03,336 INFO 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-07 21:37:03,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:03,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:03,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:03,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:03,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:03,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:03,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:03,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:03,460 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:03,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:03,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:03,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:03,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:03,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:03,580 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:03,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:03,645 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-07 21:37:03,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:03,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:03,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:03,772 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-07 21:37:03,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:03,789 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-07 21:37:03,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:37:03,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 21:37:03,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:37:03,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:37:03,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:37:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:03,811 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-07 21:37:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:03,933 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-07 21:37:03,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:37:03,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 21:37:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:03,936 INFO L225 Difference]: With dead ends: 18 [2019-01-07 21:37:03,936 INFO L226 Difference]: Without dead ends: 17 [2019-01-07 21:37:03,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:03,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-07 21:37:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-07 21:37:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 21:37:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-07 21:37:03,942 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-07 21:37:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:03,942 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-07 21:37:03,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:37:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-07 21:37:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:37:03,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:03,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:37:03,944 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-07 21:37:03,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:03,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:03,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:03,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:04,067 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-07 21:37:04,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:37:04,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:37:04,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:37:04,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:37:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:37:04,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:37:04,069 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-07 21:37:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:04,111 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-07 21:37:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:37:04,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 21:37:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:04,112 INFO L225 Difference]: With dead ends: 21 [2019-01-07 21:37:04,112 INFO L226 Difference]: Without dead ends: 20 [2019-01-07 21:37:04,113 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-07 21:37:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-07 21:37:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-07 21:37:04,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 21:37:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-07 21:37:04,118 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-07 21:37:04,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:04,118 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-07 21:37:04,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:37:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-07 21:37:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:37:04,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:04,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:37:04,120 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:04,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:04,120 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-07 21:37:04,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:04,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:04,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:04,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:04,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:04,284 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-07 21:37:04,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:04,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:04,285 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 21:37:04,285 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-07 21:37:04,289 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:04,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:04,299 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:04,300 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:04,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:04,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:04,300 INFO 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-07 21:37:04,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:04,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:04,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:04,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:04,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:04,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:04,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:04,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:04,380 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:04,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:04,436 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:04,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:04,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:04,507 INFO L267 ElimStorePlain]: Start 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-07 21:37:04,507 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:04,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:04,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 72 [2019-01-07 21:37:04,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:04,676 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-07 21:37:04,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:04,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:04,760 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-07 21:37:04,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:04,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:37:04,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:04,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:37:04,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:37:04,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:04,779 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-07 21:37:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:05,028 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-07 21:37:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:37:05,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 21:37:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:05,031 INFO L225 Difference]: With dead ends: 39 [2019-01-07 21:37:05,031 INFO L226 Difference]: Without dead ends: 38 [2019-01-07 21:37:05,032 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-07 21:37:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-07 21:37:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-07 21:37:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-07 21:37:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-07 21:37:05,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-07 21:37:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:05,038 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-07 21:37:05,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:37:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-07 21:37:05,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:05,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:05,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:05,039 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:05,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:05,040 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-07 21:37:05,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:05,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:05,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:05,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:05,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:05,200 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-07 21:37:05,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:05,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:05,200 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:05,201 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-07 21:37:05,204 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:05,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:05,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:05,222 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:05,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:05,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:05,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 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-07 21:37:05,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:05,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:05,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:05,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:05,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:05,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:05,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:05,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:05,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:05,402 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:05,421 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:05,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:05,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:05,462 INFO L267 ElimStorePlain]: Start 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-07 21:37:05,462 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:05,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:37:05,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:05,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:05,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:05,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:05,693 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-07 21:37:05,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:05,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:05,742 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-07 21:37:05,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:05,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:05,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:05,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:05,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:05,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:05,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:05,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:05,826 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-07 21:37:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:06,430 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-01-07 21:37:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:06,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:37:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:06,432 INFO L225 Difference]: With dead ends: 49 [2019-01-07 21:37:06,432 INFO L226 Difference]: Without dead ends: 44 [2019-01-07 21:37:06,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-07 21:37:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-01-07 21:37:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-07 21:37:06,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-07 21:37:06,439 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-07 21:37:06,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:06,440 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-07 21:37:06,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-07 21:37:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:06,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:06,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:06,441 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:06,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:06,441 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-01-07 21:37:06,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:06,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:06,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:06,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:06,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:06,581 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-07 21:37:06,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:06,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:06,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:06,582 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-07 21:37:06,584 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:06,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:06,593 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:06,593 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:06,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:06,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:06,594 INFO 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-07 21:37:06,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:06,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:06,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:06,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 18 treesize of output 21 [2019-01-07 21:37:06,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:06,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:06,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:06,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:06,684 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:06,717 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:06,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:06,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:06,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:06,776 INFO L267 ElimStorePlain]: Start 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-07 21:37:06,777 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:06,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:06,868 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-07 21:37:06,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:06,932 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-07 21:37:06,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:06,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:07,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:07,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:07,139 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-07 21:37:07,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:07,154 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-07 21:37:07,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:07,181 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-07 21:37:07,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:07,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:37:07,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:07,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:37:07,202 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-07 21:37:07,520 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-07 21:37:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:08,053 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-01-07 21:37:08,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:08,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:37:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:08,056 INFO L225 Difference]: With dead ends: 47 [2019-01-07 21:37:08,056 INFO L226 Difference]: Without dead ends: 46 [2019-01-07 21:37:08,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-07 21:37:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-01-07 21:37:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-07 21:37:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-01-07 21:37:08,065 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-01-07 21:37:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:08,065 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-01-07 21:37:08,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-01-07 21:37:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:08,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:08,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:08,067 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:08,067 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-07 21:37:08,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:08,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:08,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:08,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:08,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:08,143 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-07 21:37:08,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:08,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:08,144 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:08,144 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-07 21:37:08,146 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:08,146 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:08,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:08,157 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:08,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:08,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:08,158 INFO 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-07 21:37:08,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:08,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:08,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:08,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:08,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:08,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:08,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:08,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:08,264 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,288 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,313 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,352 INFO L267 ElimStorePlain]: Start 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-07 21:37:08,353 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:08,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:37:08,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,451 INFO L267 ElimStorePlain]: Start 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-07 21:37:08,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:08,469 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-07 21:37:08,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:08,480 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-07 21:37:08,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:37:08,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 21:37:08,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:37:08,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:37:08,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:37:08,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:08,501 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-01-07 21:37:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:08,657 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-01-07 21:37:08,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:37:08,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 21:37:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:08,659 INFO L225 Difference]: With dead ends: 28 [2019-01-07 21:37:08,659 INFO L226 Difference]: Without dead ends: 27 [2019-01-07 21:37:08,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:08,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-07 21:37:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-07 21:37:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-07 21:37:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-01-07 21:37:08,667 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-01-07 21:37:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:08,667 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-01-07 21:37:08,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:37:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-01-07 21:37:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:08,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:08,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:08,669 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-07 21:37:08,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:08,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:08,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:08,803 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-07 21:37:08,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:08,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:08,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:08,805 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-07 21:37:08,806 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:08,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:08,814 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:08,814 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:08,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:08,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:08,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:08,815 INFO 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-07 21:37:08,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:08,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:08,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:08,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:08,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:08,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:08,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:08,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:08,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:08,886 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,917 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:08,989 INFO L267 ElimStorePlain]: Start 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-07 21:37:08,990 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:09,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:37:09,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:09,082 INFO L267 ElimStorePlain]: Start 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-07 21:37:09,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:09,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,201 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:09,203 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-07 21:37:09,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:09,255 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-07 21:37:09,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:09,283 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-07 21:37:09,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:09,311 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-07 21:37:09,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:09,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:09,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:09,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:09,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:09,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:09,335 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-01-07 21:37:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:09,815 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-01-07 21:37:09,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:09,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:37:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:09,817 INFO L225 Difference]: With dead ends: 44 [2019-01-07 21:37:09,817 INFO L226 Difference]: Without dead ends: 43 [2019-01-07 21:37:09,817 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-07 21:37:09,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-07 21:37:09,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-01-07 21:37:09,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-07 21:37:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-01-07 21:37:09,824 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-01-07 21:37:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:09,825 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-01-07 21:37:09,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:09,825 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-01-07 21:37:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:09,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:09,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:09,826 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-07 21:37:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:09,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:09,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:09,892 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-07 21:37:09,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:09,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:09,893 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:09,893 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-07 21:37:09,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:09,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:09,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:09,900 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:09,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:09,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:09,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:09,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:09,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:09,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:09,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:09,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:09,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:09,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:09,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:09,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:09,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:09,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,001 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,080 INFO L267 ElimStorePlain]: Start 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-07 21:37:10,081 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:10,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:37:10,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,166 INFO L267 ElimStorePlain]: Start 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-07 21:37:10,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:10,183 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-07 21:37:10,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:10,196 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-07 21:37:10,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:10,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:37:10,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:10,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:37:10,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:37:10,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:10,218 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-01-07 21:37:10,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:10,520 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-01-07 21:37:10,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:37:10,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 21:37:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:10,522 INFO L225 Difference]: With dead ends: 43 [2019-01-07 21:37:10,522 INFO L226 Difference]: Without dead ends: 42 [2019-01-07 21:37:10,523 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-07 21:37:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-07 21:37:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-01-07 21:37:10,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-07 21:37:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-01-07 21:37:10,531 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-01-07 21:37:10,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:10,531 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-01-07 21:37:10,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:37:10,531 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-01-07 21:37:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:10,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:10,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:10,533 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-07 21:37:10,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:10,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:10,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:10,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:10,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:10,701 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-07 21:37:10,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:10,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:10,701 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:10,701 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-07 21:37:10,703 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:10,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:10,709 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:10,709 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:10,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:10,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:10,710 INFO 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-07 21:37:10,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:10,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:10,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:10,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:10,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:10,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:10,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:10,797 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:10,897 INFO L267 ElimStorePlain]: Start 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-07 21:37:10,898 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:10,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:10,990 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-07 21:37:10,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:11,053 INFO L267 ElimStorePlain]: Start 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-07 21:37:11,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:11,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,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, 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-07 21:37:11,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:11,143 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-07 21:37:11,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:11,169 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-07 21:37:11,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:11,193 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-07 21:37:11,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:11,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:11,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:11,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:11,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:11,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:11,213 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-01-07 21:37:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:11,647 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-01-07 21:37:11,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:11,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:37:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:11,649 INFO L225 Difference]: With dead ends: 56 [2019-01-07 21:37:11,649 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:37:11,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:37:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-01-07 21:37:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-07 21:37:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-07 21:37:11,658 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-07 21:37:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:11,659 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-07 21:37:11,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-07 21:37:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:11,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:11,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:11,660 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:11,660 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-01-07 21:37:11,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:11,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:11,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:11,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:11,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:11,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:11,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:11,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:11,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:11,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:11,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:11,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:37:11,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:37:11,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 21:37:11,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:11,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:11,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:11,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,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 21 treesize of output 27 [2019-01-07 21:37:11,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:11,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:11,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:11,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:11,831 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:11,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:11,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:11,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:11,898 INFO L267 ElimStorePlain]: Start 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-07 21:37:11,899 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:11,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:11,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:37:11,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:12,074 INFO L267 ElimStorePlain]: Start 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-07 21:37:12,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:12,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:12,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:12,196 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-07 21:37:12,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:12,219 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-07 21:37:12,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:12,295 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-07 21:37:12,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:12,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:37:12,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:12,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:12,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:37:12,314 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-01-07 21:37:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:12,675 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-01-07 21:37:12,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:37:12,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:37:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:12,677 INFO L225 Difference]: With dead ends: 66 [2019-01-07 21:37:12,677 INFO L226 Difference]: Without dead ends: 64 [2019-01-07 21:37:12,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-07 21:37:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-01-07 21:37:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-07 21:37:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-01-07 21:37:12,687 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-01-07 21:37:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:12,687 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-01-07 21:37:12,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-01-07 21:37:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:12,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:12,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:12,689 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-07 21:37:12,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:12,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:12,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:12,764 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-07 21:37:12,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:12,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:12,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:12,765 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-01-07 21:37:12,766 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:12,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:12,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:12,772 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:12,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:12,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:12,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:12,772 INFO 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-07 21:37:12,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:12,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:12,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:12,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:12,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:12,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:12,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:12,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:12,835 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:12,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:12,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:12,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:12,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:12,921 INFO L267 ElimStorePlain]: Start 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-07 21:37:12,922 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:12,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:12,957 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-07 21:37:12,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:12,999 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-07 21:37:12,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:13,014 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-07 21:37:13,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:13,027 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-07 21:37:13,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:13,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:37:13,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:13,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:37:13,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:37:13,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:13,048 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-01-07 21:37:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:13,237 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-01-07 21:37:13,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:37:13,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 21:37:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:13,238 INFO L225 Difference]: With dead ends: 45 [2019-01-07 21:37:13,239 INFO L226 Difference]: Without dead ends: 44 [2019-01-07 21:37:13,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:37:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-07 21:37:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-01-07 21:37:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-07 21:37:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-01-07 21:37:13,247 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-01-07 21:37:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:13,248 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-01-07 21:37:13,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:37:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-01-07 21:37:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:13,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:13,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:13,249 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-01-07 21:37:13,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:13,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:13,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:13,278 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-07 21:37:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:37:13,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 21:37:13,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:37:13,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:37:13,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:37:13,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:37:13,279 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-01-07 21:37:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:13,312 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-01-07 21:37:13,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:37:13,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 21:37:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:13,313 INFO L225 Difference]: With dead ends: 34 [2019-01-07 21:37:13,313 INFO L226 Difference]: Without dead ends: 31 [2019-01-07 21:37:13,313 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-07 21:37:13,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-07 21:37:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-07 21:37:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 21:37:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-01-07 21:37:13,322 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-01-07 21:37:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:13,322 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-01-07 21:37:13,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:37:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-01-07 21:37:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:13,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:13,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:13,323 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:13,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:13,324 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-07 21:37:13,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:13,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:13,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:13,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:13,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:13,455 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-07 21:37:13,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:13,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:13,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:13,456 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-07 21:37:13,457 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:13,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:13,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:13,462 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:13,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:13,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:13,463 INFO 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-07 21:37:13,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:13,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:13,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:13,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:13,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:13,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:13,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:13,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:13,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:13,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:13,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:13,601 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:13,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:13,629 INFO L267 ElimStorePlain]: Start 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-07 21:37:13,630 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:13,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,663 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-07 21:37:13,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:13,719 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-07 21:37:13,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:13,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:13,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:13,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:13,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-07 21:37:13,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:13,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:13,841 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-07 21:37:13,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:13,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:37:13,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:13,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:13,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:13,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:37:13,861 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-01-07 21:37:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:14,230 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-01-07 21:37:14,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:14,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:37:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:14,231 INFO L225 Difference]: With dead ends: 59 [2019-01-07 21:37:14,231 INFO L226 Difference]: Without dead ends: 58 [2019-01-07 21:37:14,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-07 21:37:14,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-01-07 21:37:14,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-07 21:37:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-01-07 21:37:14,241 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-01-07 21:37:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:14,242 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-01-07 21:37:14,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-01-07 21:37:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:14,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:14,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:14,243 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:14,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:14,243 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-07 21:37:14,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:14,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:14,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:14,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:14,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:14,329 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-07 21:37:14,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:14,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:14,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:14,330 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-07 21:37:14,332 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:14,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:14,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:14,337 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:14,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:14,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:14,337 INFO 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-07 21:37:14,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:14,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:14,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:14,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:14,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:14,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:14,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:14,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:14,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:14,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:14,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:14,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:14,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:14,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:14,479 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:14,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:14,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:37:14,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:14,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-07 21:37:14,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:14,559 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-07 21:37:14,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:14,571 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-07 21:37:14,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:14,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:37:14,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:14,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:37:14,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:37:14,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:14,592 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-01-07 21:37:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:15,031 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-01-07 21:37:15,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:37:15,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-07 21:37:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:15,032 INFO L225 Difference]: With dead ends: 51 [2019-01-07 21:37:15,034 INFO L226 Difference]: Without dead ends: 50 [2019-01-07 21:37:15,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-07 21:37:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-07 21:37:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-07 21:37:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-07 21:37:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-01-07 21:37:15,044 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-01-07 21:37:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:15,044 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-01-07 21:37:15,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:37:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-01-07 21:37:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:37:15,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:15,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:37:15,045 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-07 21:37:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:15,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:15,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:15,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:15,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-07 21:37:15,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:15,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:15,191 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:37:15,191 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-07 21:37:15,193 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:15,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:15,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:15,199 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:15,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:15,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:15,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:15,200 INFO 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-07 21:37:15,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:15,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:15,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:15,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:15,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:15,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:15,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:15,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:15,290 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:15,316 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:15,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:15,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:15,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:15,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:15,372 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:15,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,436 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-07 21:37:15,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:15,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:15,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:15,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:15,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:15,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:15,579 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-07 21:37:15,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:15,608 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-07 21:37:15,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:15,631 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-07 21:37:15,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:15,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:15,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:15,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:15,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:15,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:15,651 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-01-07 21:37:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:16,127 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-01-07 21:37:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:16,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 21:37:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:16,128 INFO L225 Difference]: With dead ends: 64 [2019-01-07 21:37:16,129 INFO L226 Difference]: Without dead ends: 63 [2019-01-07 21:37:16,129 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-07 21:37:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-07 21:37:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-01-07 21:37:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-07 21:37:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-07 21:37:16,138 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-01-07 21:37:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:16,138 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-07 21:37:16,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-07 21:37:16,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:16,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:16,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:16,139 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:16,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:16,139 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-07 21:37:16,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:16,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:16,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:16,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:16,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:16,235 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-07 21:37:16,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:16,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:16,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:16,236 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-07 21:37:16,237 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:16,237 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:16,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:16,243 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:16,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:16,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:16,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 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-07 21:37:16,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:16,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:16,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:16,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:16,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:16,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:16,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:16,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:16,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:16,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:16,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:16,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:16,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:16,395 INFO L267 ElimStorePlain]: Start 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-07 21:37:16,396 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:16,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 21:37:16,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:16,500 INFO L267 ElimStorePlain]: Start 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-07 21:37:16,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:16,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:16,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 21:37:16,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:16,556 INFO L267 ElimStorePlain]: Start 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-07 21:37:16,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:37:16,574 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-07 21:37:16,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:16,596 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-07 21:37:16,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:16,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:16,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:16,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:16,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:16,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:16,616 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-07 21:37:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:16,949 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-01-07 21:37:16,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:16,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:16,951 INFO L225 Difference]: With dead ends: 57 [2019-01-07 21:37:16,951 INFO L226 Difference]: Without dead ends: 56 [2019-01-07 21:37:16,952 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-07 21:37:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-07 21:37:16,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-07 21:37:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-07 21:37:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-01-07 21:37:16,962 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-01-07 21:37:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:16,962 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-01-07 21:37:16,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-01-07 21:37:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:16,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:16,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:16,963 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:16,964 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-07 21:37:16,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:16,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:17,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-07 21:37:17,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:17,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:17,175 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:17,176 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-07 21:37:17,177 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:17,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:17,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:17,182 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:17,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:17,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:17,183 INFO 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-07 21:37:17,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:17,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:17,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:17,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:17,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:17,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:17,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:17,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,438 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-07 21:37:17,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:17,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:17,596 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:17,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:17,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:17,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:17,661 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-07 21:37:17,662 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:17,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,704 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-07 21:37:17,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:17,748 INFO L267 ElimStorePlain]: Start 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-07 21:37:17,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:17,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:17,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:17,837 INFO L267 ElimStorePlain]: Start 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-07 21:37:17,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:17,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:17,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:17,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:37:17,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:17,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-07 21:37:17,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:17,997 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-07 21:37:17,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:18,041 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-07 21:37:18,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:18,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:37:18,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:18,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:18,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:37:18,061 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-01-07 21:37:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:19,134 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-01-07 21:37:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:19,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:37:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:19,136 INFO L225 Difference]: With dead ends: 68 [2019-01-07 21:37:19,136 INFO L226 Difference]: Without dead ends: 67 [2019-01-07 21:37:19,136 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-07 21:37:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-07 21:37:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-01-07 21:37:19,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-07 21:37:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-07 21:37:19,147 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-07 21:37:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:19,147 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-07 21:37:19,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-07 21:37:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:19,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:19,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:19,148 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:19,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:19,149 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-07 21:37:19,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:19,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:19,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:19,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:19,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:19,341 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-07 21:37:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:19,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:19,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:19,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:19,368 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-07 21:37:19,370 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:19,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:19,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:19,374 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:19,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:19,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:19,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:19,375 INFO 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-07 21:37:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:19,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:19,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:19,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:19,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:19,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:19,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:19,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:19,512 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:19,539 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:19,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:19,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:19,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:19,594 INFO L267 ElimStorePlain]: Start 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-07 21:37:19,594 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:19,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,630 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-07 21:37:19,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:19,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:19,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:19,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:19,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:19,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:19,765 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-07 21:37:19,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:19,787 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-07 21:37:19,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:19,809 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-07 21:37:19,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:19,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:19,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:19,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:19,830 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-07 21:37:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:20,277 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-01-07 21:37:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:20,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:20,278 INFO L225 Difference]: With dead ends: 56 [2019-01-07 21:37:20,278 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:37:20,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:37:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-01-07 21:37:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-07 21:37:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-07 21:37:20,287 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-07 21:37:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:20,288 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-07 21:37:20,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-07 21:37:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:20,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:20,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:20,289 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:20,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-01-07 21:37:20,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:20,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:20,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:20,349 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-07 21:37:20,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:20,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:20,350 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:20,350 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-07 21:37:20,351 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:20,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:20,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:20,356 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:20,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:20,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:20,357 INFO 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-07 21:37:20,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:20,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:20,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:20,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:20,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:20,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:37:20,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:20,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:37:20,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:20,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:20,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:37:20,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:20,432 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:20,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:20,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:20,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:20,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:20,477 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-07 21:37:20,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:20,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:20,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:20,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:20,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-07 21:37:20,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:20,527 INFO L267 ElimStorePlain]: Start 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-07 21:37:20,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:37:20,541 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-07 21:37:20,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:20,551 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-07 21:37:20,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:20,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:37:20,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:20,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:37:20,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:37:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:20,571 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-01-07 21:37:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:20,702 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-01-07 21:37:20,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:37:20,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-07 21:37:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:20,704 INFO L225 Difference]: With dead ends: 45 [2019-01-07 21:37:20,704 INFO L226 Difference]: Without dead ends: 44 [2019-01-07 21:37:20,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:37:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-07 21:37:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-01-07 21:37:20,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-07 21:37:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-01-07 21:37:20,716 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-01-07 21:37:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:20,716 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-01-07 21:37:20,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:37:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-01-07 21:37:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:20,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:20,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:20,717 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:20,717 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-01-07 21:37:20,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:20,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:20,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:20,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:20,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:20,975 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-07 21:37:21,005 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-07 21:37:21,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:21,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:21,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:21,007 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-01-07 21:37:21,008 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:21,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:21,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:21,012 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:21,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:21,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:21,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 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-07 21:37:21,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:21,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:21,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:21,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:21,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:21,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:21,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:21,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:21,082 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:21,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:21,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:21,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:21,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:21,538 INFO L267 ElimStorePlain]: Start 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-07 21:37:21,538 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:21,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,659 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-07 21:37:21,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:21,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:21,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:21,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,827 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:21,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-07 21:37:21,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:21,877 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-07 21:37:21,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:21,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:21,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:21,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:21,966 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-07 21:37:21,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:37:21,981 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-07 21:37:21,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:22,022 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-07 21:37:22,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:22,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:37:22,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:22,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:22,042 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-01-07 21:37:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:22,626 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-01-07 21:37:22,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:37:22,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:37:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:22,629 INFO L225 Difference]: With dead ends: 71 [2019-01-07 21:37:22,629 INFO L226 Difference]: Without dead ends: 70 [2019-01-07 21:37:22,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:37:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-07 21:37:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-01-07 21:37:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-07 21:37:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-01-07 21:37:22,638 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-01-07 21:37:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:22,639 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-01-07 21:37:22,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-01-07 21:37:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:22,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:22,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:22,640 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-07 21:37:22,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:22,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:22,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:22,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:22,849 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-07 21:37:22,872 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-07 21:37:22,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:22,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:22,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:22,872 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-07 21:37:22,873 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:22,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:22,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:22,877 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:22,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:22,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:22,878 INFO 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-07 21:37:22,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:22,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:22,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:22,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 18 treesize of output 21 [2019-01-07 21:37:22,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:22,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:22,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:22,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:22,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:22,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:22,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:22,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:22,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:22,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:22,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:22,950 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:22,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:22,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:22,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:22,996 INFO L267 ElimStorePlain]: Start 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-07 21:37:22,997 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:23,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:37:23,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:23,067 INFO L267 ElimStorePlain]: Start 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-07 21:37:23,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:23,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:23,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, 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-07 21:37:23,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:23,222 INFO L267 ElimStorePlain]: Start 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-07 21:37:23,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:37:23,239 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-07 21:37:23,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:23,259 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-07 21:37:23,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:23,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:23,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:23,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:23,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:23,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:23,279 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-01-07 21:37:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:23,569 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-01-07 21:37:23,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:23,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:23,571 INFO L225 Difference]: With dead ends: 59 [2019-01-07 21:37:23,571 INFO L226 Difference]: Without dead ends: 58 [2019-01-07 21:37:23,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-07 21:37:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-01-07 21:37:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 21:37:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-07 21:37:23,582 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-07 21:37:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:23,583 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-07 21:37:23,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-07 21:37:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:23,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:23,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:23,584 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-07 21:37:23,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:23,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:23,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:23,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:23,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:23,918 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-07 21:37:23,944 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-07 21:37:23,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:23,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:23,945 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:23,945 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-07 21:37:23,946 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:23,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:23,949 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:23,949 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:23,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:23,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:23,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 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-07 21:37:23,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:23,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:23,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:23,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:24,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:24,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:24,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:24,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:24,030 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:24,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:24,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:24,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:24,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:24,112 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-07 21:37:24,113 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:24,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,152 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-07 21:37:24,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:24,210 INFO L267 ElimStorePlain]: Start 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-07 21:37:24,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:24,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:24,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:24,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:24,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:24,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,336 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:24,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:24,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:24,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:24,411 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-07 21:37:24,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:24,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:24,482 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-07 21:37:24,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:24,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:37:24,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:24,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:24,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:24,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:37:24,503 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-07 21:37:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:25,303 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-01-07 21:37:25,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:25,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:37:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:25,304 INFO L225 Difference]: With dead ends: 71 [2019-01-07 21:37:25,304 INFO L226 Difference]: Without dead ends: 70 [2019-01-07 21:37:25,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:37:25,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-07 21:37:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-07 21:37:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-07 21:37:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-01-07 21:37:25,315 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-01-07 21:37:25,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:25,315 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-01-07 21:37:25,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-01-07 21:37:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:25,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:25,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:25,316 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:25,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-07 21:37:25,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:25,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:25,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:25,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:25,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:25,428 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-07 21:37:25,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:25,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:25,429 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:25,429 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-07 21:37:25,430 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:25,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:25,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:25,434 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:25,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:25,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:25,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:25,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:25,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:25,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:25,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:25,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,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 21 treesize of output 27 [2019-01-07 21:37:25,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:25,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:25,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:25,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:25,583 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:25,599 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:25,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:25,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:25,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:25,641 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:25,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,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, 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-07 21:37:25,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:25,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-07 21:37:25,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:25,916 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-07 21:37:25,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:25,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:26,222 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:26,222 INFO L303 Elim1Store]: Index analysis took 303 ms [2019-01-07 21:37:26,223 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-07 21:37:26,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:26,726 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-07 21:37:26,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:26,919 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-07 21:37:26,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:27,157 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-07 21:37:27,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:27,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:27,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:27,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:27,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:27,178 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-01-07 21:37:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:27,550 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-01-07 21:37:27,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:27,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:27,552 INFO L225 Difference]: With dead ends: 66 [2019-01-07 21:37:27,552 INFO L226 Difference]: Without dead ends: 65 [2019-01-07 21:37:27,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:27,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-07 21:37:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-01-07 21:37:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 21:37:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-07 21:37:27,567 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-07 21:37:27,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:27,568 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-07 21:37:27,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-07 21:37:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:27,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:27,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:27,569 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-01-07 21:37:27,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:27,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:27,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:27,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:27,752 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-07 21:37:27,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:27,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:27,753 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:27,753 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-01-07 21:37:27,754 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:27,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:27,757 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:27,758 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:27,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:27,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:27,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:27,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:27,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:27,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:27,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:27,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:27,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:27,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:27,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:27,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:27,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:27,860 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:27,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:27,891 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:27,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:27,921 INFO L267 ElimStorePlain]: Start 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-07 21:37:27,922 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:27,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:27,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, 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-07 21:37:27,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:28,011 INFO L267 ElimStorePlain]: Start 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-07 21:37:28,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:28,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,050 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:28,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, 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-07 21:37:28,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:28,101 INFO L267 ElimStorePlain]: Start 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-07 21:37:28,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:28,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:28,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:28,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:28,243 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-07 21:37:28,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:28,265 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-07 21:37:28,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:28,300 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-07 21:37:28,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:28,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:37:28,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:28,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:28,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:28,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:37:28,319 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-07 21:37:28,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:28,956 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-01-07 21:37:28,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:37:28,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:37:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:28,958 INFO L225 Difference]: With dead ends: 93 [2019-01-07 21:37:28,958 INFO L226 Difference]: Without dead ends: 92 [2019-01-07 21:37:28,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:37:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-07 21:37:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-01-07 21:37:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-07 21:37:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-01-07 21:37:28,972 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-01-07 21:37:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:28,972 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-01-07 21:37:28,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-01-07 21:37:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:28,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:28,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:28,973 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:28,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-07 21:37:28,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:28,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:28,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:29,054 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-07 21:37:29,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:29,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:29,055 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:29,055 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-07 21:37:29,058 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:29,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:29,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:29,061 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:29,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:29,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:29,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:29,062 INFO 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-07 21:37:29,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:29,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:29,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:29,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:29,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:29,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:37:29,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,356 INFO L303 Elim1Store]: Index analysis took 139 ms [2019-01-07 21:37:29,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:37:29,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:37:29,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:29,428 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-07 21:37:29,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-07 21:37:29,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,470 INFO L267 ElimStorePlain]: Start 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-07 21:37:29,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:37:29,482 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-07 21:37:29,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:29,490 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-07 21:37:29,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:37:29,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 21:37:29,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:37:29,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:37:29,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:37:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:29,509 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-01-07 21:37:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:29,550 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-01-07 21:37:29,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:37:29,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 21:37:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:29,551 INFO L225 Difference]: With dead ends: 56 [2019-01-07 21:37:29,551 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:37:29,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:37:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-07 21:37:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-07 21:37:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-01-07 21:37:29,565 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-01-07 21:37:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:29,565 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-01-07 21:37:29,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:37:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-01-07 21:37:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:29,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:29,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:29,566 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-01-07 21:37:29,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:29,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:29,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:29,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:29,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:29,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:29,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:29,651 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:29,651 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-07 21:37:29,652 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:29,652 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:29,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:29,655 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:29,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:29,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:29,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:29,656 INFO 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-07 21:37:29,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:29,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:29,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:29,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:29,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:29,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:29,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:29,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:29,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:29,715 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:29,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-07 21:37:29,781 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:30,786 WARN L181 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-07 21:37:30,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:37:30,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:30,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-07 21:37:30,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:30,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:30,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-07 21:37:30,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:30,915 INFO L267 ElimStorePlain]: Start 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-07 21:37:30,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:30,930 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-07 21:37:30,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:30,948 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-07 21:37:30,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:30,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:30,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:30,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:30,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:30,969 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-01-07 21:37:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:31,336 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-01-07 21:37:31,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:31,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:31,338 INFO L225 Difference]: With dead ends: 85 [2019-01-07 21:37:31,338 INFO L226 Difference]: Without dead ends: 84 [2019-01-07 21:37:31,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:37:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-07 21:37:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-01-07 21:37:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-07 21:37:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-01-07 21:37:31,353 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-01-07 21:37:31,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:31,354 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-01-07 21:37:31,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-01-07 21:37:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:31,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:31,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:31,355 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-01-07 21:37:31,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:31,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:31,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:31,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:31,528 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-07 21:37:31,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:31,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:31,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:31,529 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-01-07 21:37:31,530 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:31,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:31,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:31,533 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:31,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:31,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:31,534 INFO 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-07 21:37:31,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:31,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:31,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:31,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:31,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:31,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:31,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:31,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:31,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:31,600 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:31,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:31,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:31,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:31,654 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-07 21:37:31,655 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:31,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,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, 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-07 21:37:31,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:31,731 INFO L267 ElimStorePlain]: Start 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-07 21:37:31,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:31,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:31,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:31,816 INFO L267 ElimStorePlain]: Start 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-07 21:37:31,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:31,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:31,855 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:31,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:31,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:31,955 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-07 21:37:31,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:31,991 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-07 21:37:31,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:32,029 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-07 21:37:32,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:32,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:37:32,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:32,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:32,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:32,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:37:32,048 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-01-07 21:37:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:32,800 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-01-07 21:37:32,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:32,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:37:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:32,802 INFO L225 Difference]: With dead ends: 96 [2019-01-07 21:37:32,802 INFO L226 Difference]: Without dead ends: 94 [2019-01-07 21:37:32,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:37:32,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-07 21:37:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-01-07 21:37:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-07 21:37:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-07 21:37:32,819 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-07 21:37:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:32,820 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-07 21:37:32,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-07 21:37:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:32,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:32,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:32,820 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:32,821 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-07 21:37:32,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:32,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:32,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:32,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:32,948 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-07 21:37:32,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:32,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:32,948 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:32,949 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-07 21:37:32,949 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:32,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:32,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:32,953 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:32,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:32,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:32,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:32,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:32,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:32,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:32,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:32,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 18 treesize of output 21 [2019-01-07 21:37:32,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:32,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:32,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:33,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:33,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:33,017 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,037 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,084 INFO L267 ElimStorePlain]: Start 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-07 21:37:33,084 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:33,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:37:33,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,280 INFO L267 ElimStorePlain]: Start 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-07 21:37:33,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:33,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:33,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-07 21:37:33,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,338 INFO L267 ElimStorePlain]: Start 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-07 21:37:33,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:33,353 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-07 21:37:33,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:33,374 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-07 21:37:33,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:33,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:33,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:33,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:33,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:33,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:33,394 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-07 21:37:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:33,753 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-01-07 21:37:33,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:33,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:33,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:33,755 INFO L225 Difference]: With dead ends: 82 [2019-01-07 21:37:33,755 INFO L226 Difference]: Without dead ends: 81 [2019-01-07 21:37:33,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-07 21:37:33,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-01-07 21:37:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-07 21:37:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-07 21:37:33,775 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-07 21:37:33,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:33,775 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-07 21:37:33,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:33,775 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-07 21:37:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:33,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:33,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:33,776 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:33,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:33,776 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-07 21:37:33,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:33,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:33,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:33,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:33,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:33,872 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-07 21:37:33,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:33,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:33,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:33,873 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-07 21:37:33,874 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:33,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:33,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:33,877 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:33,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:33,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:33,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:33,877 INFO 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-07 21:37:33,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:33,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:33,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:33,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:33,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:33,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:33,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:33,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:33,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:33,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:33,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:34,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:34,006 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:34,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:37:34,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:34,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-07 21:37:34,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:34,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:37:34,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:34,316 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-07 21:37:34,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:34,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:34,346 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-07 21:37:34,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:34,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:37:34,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:34,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:37:34,365 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-07 21:37:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:34,687 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-01-07 21:37:34,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:34,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:34,689 INFO L225 Difference]: With dead ends: 87 [2019-01-07 21:37:34,689 INFO L226 Difference]: Without dead ends: 86 [2019-01-07 21:37:34,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-07 21:37:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-01-07 21:37:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-07 21:37:34,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-01-07 21:37:34,709 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-01-07 21:37:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:34,709 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-01-07 21:37:34,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-01-07 21:37:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:34,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:34,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:34,710 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:34,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:34,711 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-07 21:37:34,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:34,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:34,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:34,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:34,799 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-07 21:37:34,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:34,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:34,799 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:34,799 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-07 21:37:34,800 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:34,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:34,803 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:34,803 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:34,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:34,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:34,804 INFO 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-07 21:37:34,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:34,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:34,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:34,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:34,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:34,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:34,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:34,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:34,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:34,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:34,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:34,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:34,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:34,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:34,981 INFO L267 ElimStorePlain]: Start 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-07 21:37:34,982 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:35,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,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, 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-07 21:37:35,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:35,058 INFO L267 ElimStorePlain]: Start 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-07 21:37:35,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:35,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:35,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:37:35,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:35,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:35,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:35,159 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-07 21:37:35,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:35,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:35,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:35,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:35,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:35,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:35,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:35,202 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-01-07 21:37:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:35,598 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-01-07 21:37:35,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:35,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:35,600 INFO L225 Difference]: With dead ends: 86 [2019-01-07 21:37:35,600 INFO L226 Difference]: Without dead ends: 85 [2019-01-07 21:37:35,601 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-07 21:37:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-07 21:37:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-01-07 21:37:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-07 21:37:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-01-07 21:37:35,624 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-01-07 21:37:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:35,625 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-01-07 21:37:35,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-01-07 21:37:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:35,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:35,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:35,626 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-01-07 21:37:35,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:35,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:35,896 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-07 21:37:36,191 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-07 21:37:36,209 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-07 21:37:36,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:36,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:36,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:36,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:36,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:36,210 INFO 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-07 21:37:36,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:37:36,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:37:36,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 21:37:36,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:36,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:36,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:36,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:36,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:36,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:36,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:36,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:36,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:36,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:36,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:36,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:36,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:36,361 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:36,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:37:36,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:36,420 INFO L267 ElimStorePlain]: Start 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-07 21:37:36,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:36,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:36,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:37:36,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:36,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:36,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:37:36,494 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-07 21:37:36,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:36,546 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-07 21:37:36,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:36,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:37:36,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:36,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:37:36,566 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-01-07 21:37:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:37,518 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-01-07 21:37:37,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:37:37,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:37,520 INFO L225 Difference]: With dead ends: 110 [2019-01-07 21:37:37,520 INFO L226 Difference]: Without dead ends: 107 [2019-01-07 21:37:37,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-07 21:37:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-01-07 21:37:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-07 21:37:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-01-07 21:37:37,551 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-01-07 21:37:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:37,551 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-01-07 21:37:37,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-01-07 21:37:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:37,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:37,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:37,552 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:37,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-07 21:37:37,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:37,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:37,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:37,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:37,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:37,702 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-07 21:37:37,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:37,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:37,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:37,703 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-01-07 21:37:37,704 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:37,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:37,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:37,708 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:37:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:37,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:37,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:37,708 INFO 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-07 21:37:37,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:37,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:37,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:37,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:37,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:37,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:37,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:37,761 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:37,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:37,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:37,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:37,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:37,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:37,831 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:37,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:37,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:37:37,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:37,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:37,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:37,907 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-07 21:37:37,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:37,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:37,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 21:37:37,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:37,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:37:37,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:37:37,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:37:37,938 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-01-07 21:37:38,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:38,206 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-01-07 21:37:38,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:37:38,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-07 21:37:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:38,208 INFO L225 Difference]: With dead ends: 87 [2019-01-07 21:37:38,208 INFO L226 Difference]: Without dead ends: 86 [2019-01-07 21:37:38,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 21:37:38,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-07 21:37:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-01-07 21:37:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-07 21:37:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-01-07 21:37:38,233 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-01-07 21:37:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:38,234 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-01-07 21:37:38,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:37:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-01-07 21:37:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:38,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:38,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:38,235 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-01-07 21:37:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:38,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:38,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:38,555 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-07 21:37:38,595 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-07 21:37:38,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:38,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:38,595 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:38,596 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-01-07 21:37:38,596 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:38,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:38,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:38,600 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:38,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:38,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:38,600 INFO 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-07 21:37:38,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:38,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:38,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:38,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:38,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:38,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:38,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:38,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:38,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,693 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,721 INFO L267 ElimStorePlain]: Start 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-07 21:37:38,722 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:38,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,758 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-07 21:37:38,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,802 INFO L267 ElimStorePlain]: Start 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-07 21:37:38,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:38,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,836 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:38,837 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-07 21:37:38,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,881 INFO L267 ElimStorePlain]: Start 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-07 21:37:38,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:38,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:38,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:38,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,967 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-07 21:37:38,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:38,989 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-07 21:37:38,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:39,022 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-07 21:37:39,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:39,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:37:39,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:39,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:39,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:37:39,042 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-01-07 21:37:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:39,605 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-01-07 21:37:39,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:37:39,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-07 21:37:39,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:39,607 INFO L225 Difference]: With dead ends: 133 [2019-01-07 21:37:39,607 INFO L226 Difference]: Without dead ends: 132 [2019-01-07 21:37:39,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:37:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-07 21:37:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-01-07 21:37:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-07 21:37:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-01-07 21:37:39,629 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-01-07 21:37:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:39,629 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-01-07 21:37:39,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-01-07 21:37:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:37:39,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:39,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:37:39,630 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-01-07 21:37:39,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:39,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:39,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:39,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:39,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:39,783 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-07 21:37:39,791 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-07 21:37:39,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:39,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:39,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 21:37:39,792 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-07 21:37:39,792 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:39,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:39,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:39,795 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:39,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:39,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:39,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:39,796 INFO 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-07 21:37:39,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:39,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:39,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:39,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:39,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:39,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:39,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:39,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:39,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:39,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:39,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:39,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:39,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:39,915 INFO L267 ElimStorePlain]: Start 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-07 21:37:39,915 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:37:39,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:39,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:39,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:39,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:39,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-07 21:37:40,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:40,040 INFO L267 ElimStorePlain]: Start 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-07 21:37:40,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:40,055 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-07 21:37:40,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:40,073 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-07 21:37:40,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:40,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:40,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:40,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:40,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:40,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:40,092 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-01-07 21:37:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:40,437 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-01-07 21:37:40,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:40,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-07 21:37:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:40,439 INFO L225 Difference]: With dead ends: 113 [2019-01-07 21:37:40,439 INFO L226 Difference]: Without dead ends: 112 [2019-01-07 21:37:40,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:37:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-07 21:37:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-01-07 21:37:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:37:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-01-07 21:37:40,468 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-01-07 21:37:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:40,469 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-01-07 21:37:40,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-01-07 21:37:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:40,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:40,470 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-07 21:37:40,470 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:40,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:40,470 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-01-07 21:37:40,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:40,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:40,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:40,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:40,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:40,628 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-07 21:37:40,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:40,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:40,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:40,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:40,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:40,629 INFO 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-07 21:37:40,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:37:40,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:37:40,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:37:40,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:40,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:40,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:40,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:40,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:40,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:40,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:40,683 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:40,740 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:40,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:40,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:40,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:40,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:40,805 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:40,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,874 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-07 21:37:40,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:40,913 INFO L267 ElimStorePlain]: Start 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-07 21:37:40,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:40,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:40,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-07 21:37:40,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:40,998 INFO L267 ElimStorePlain]: Start 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-07 21:37:40,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:41,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:37:41,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:41,081 INFO L267 ElimStorePlain]: Start 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-07 21:37:41,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:41,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:41,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-07 21:37:41,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:41,183 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-07 21:37:41,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:41,207 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-07 21:37:41,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:41,260 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-07 21:37:41,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:41,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:37:41,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:41,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:37:41,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:37:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:37:41,281 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-01-07 21:37:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:42,070 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-01-07 21:37:42,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:37:42,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-07 21:37:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:42,073 INFO L225 Difference]: With dead ends: 136 [2019-01-07 21:37:42,073 INFO L226 Difference]: Without dead ends: 131 [2019-01-07 21:37:42,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:37:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-07 21:37:42,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-01-07 21:37:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:37:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-07 21:37:42,101 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-07 21:37:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:42,101 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-07 21:37:42,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:37:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-07 21:37:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:42,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:42,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:42,102 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:42,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-07 21:37:42,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:42,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:42,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:42,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:42,665 WARN L181 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:37:42,729 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-07 21:37:42,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:42,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:42,730 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:42,730 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-07 21:37:42,731 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:42,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:42,733 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:42,733 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:42,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:42,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:42,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:42,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:42,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:42,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:42,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:42,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:42,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:42,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:42,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:42,819 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:42,846 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:42,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:42,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:42,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:42,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:42,903 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:42,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:42,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:37:42,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:42,984 INFO L267 ElimStorePlain]: Start 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-07 21:37:42,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:43,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:43,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:43,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:43,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:43,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,107 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:43,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:43,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:43,158 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-07 21:37:43,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:43,180 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-07 21:37:43,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:43,219 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-07 21:37:43,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:43,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:37:43,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:43,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:43,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:37:43,240 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-01-07 21:37:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:43,758 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-01-07 21:37:43,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:43,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:37:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:43,760 INFO L225 Difference]: With dead ends: 106 [2019-01-07 21:37:43,760 INFO L226 Difference]: Without dead ends: 105 [2019-01-07 21:37:43,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:37:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-07 21:37:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-01-07 21:37:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:37:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-07 21:37:43,783 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-07 21:37:43,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:43,783 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-07 21:37:43,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-07 21:37:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:43,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:43,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:43,784 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-01-07 21:37:43,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:43,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:43,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:43,953 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-07 21:37:43,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:43,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:43,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:43,953 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-01-07 21:37:43,954 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:43,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:43,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:43,956 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:37:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:43,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:43,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:43,957 INFO 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-07 21:37:43,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:43,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:43,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:43,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:43,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:43,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:43,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:43,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:43,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:44,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,087 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-07 21:37:44,088 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:44,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,126 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-07 21:37:44,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,166 INFO L267 ElimStorePlain]: Start 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-07 21:37:44,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:44,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-07 21:37:44,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,270 INFO L267 ElimStorePlain]: Start 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-07 21:37:44,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:44,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,319 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:44,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-07 21:37:44,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,391 INFO L267 ElimStorePlain]: Start 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-07 21:37:44,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:44,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,431 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:44,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:44,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:44,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:44,491 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-07 21:37:44,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:44,518 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-07 21:37:44,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:44,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:44,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:37:44,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:44,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:37:44,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:37:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:37:44,604 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-07 21:37:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:45,392 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-01-07 21:37:45,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:37:45,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:37:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:45,395 INFO L225 Difference]: With dead ends: 131 [2019-01-07 21:37:45,395 INFO L226 Difference]: Without dead ends: 130 [2019-01-07 21:37:45,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:37:45,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-07 21:37:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-01-07 21:37:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:37:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-07 21:37:45,420 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-07 21:37:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:45,420 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-07 21:37:45,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:37:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-07 21:37:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:45,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:45,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:45,421 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-01-07 21:37:45,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:45,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:45,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:45,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:45,699 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-07 21:37:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:45,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:45,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:45,722 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:45,722 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-07 21:37:45,723 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:45,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:45,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:45,727 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:45,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:45,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:45,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:45,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:45,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:45,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:45,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:45,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:45,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:45,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:37:45,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:37:45,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:37:45,805 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:45,824 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:45,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:45,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:45,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:45,886 INFO L267 ElimStorePlain]: Start 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-07 21:37:45,886 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-07 21:37:45,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-07 21:37:45,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:45,951 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-07 21:37:45,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:37:45,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:45,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-07 21:37:45,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:45,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:45,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:37:46,005 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-07 21:37:46,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:46,027 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-07 21:37:46,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:46,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:46,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:46,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:46,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:46,047 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-01-07 21:37:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:46,283 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-01-07 21:37:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:46,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:37:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:46,286 INFO L225 Difference]: With dead ends: 93 [2019-01-07 21:37:46,286 INFO L226 Difference]: Without dead ends: 92 [2019-01-07 21:37:46,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-07 21:37:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-01-07 21:37:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:37:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-07 21:37:46,310 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-07 21:37:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:46,311 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-07 21:37:46,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:46,311 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-07 21:37:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:46,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:46,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:46,311 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:46,312 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-01-07 21:37:46,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:46,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:46,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:46,523 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-07 21:37:46,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:46,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:46,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:46,524 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-01-07 21:37:46,525 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:46,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:46,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:46,529 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:37:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:46,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:46,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:46,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:46,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:46,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:46,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:46,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:46,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:46,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:46,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,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 25 treesize of output 51 [2019-01-07 21:37:46,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:46,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:46,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:46,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:46,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:46,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:46,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:46,691 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:46,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,728 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-07 21:37:46,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:46,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:46,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:46,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:46,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,042 INFO L303 Elim1Store]: Index analysis took 250 ms [2019-01-07 21:37:47,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:47,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:47,084 INFO L267 ElimStorePlain]: Start 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-07 21:37:47,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:47,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:47,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:47,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:47,173 INFO L267 ElimStorePlain]: Start 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-07 21:37:47,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:47,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:47,214 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:47,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, 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-07 21:37:47,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:47,264 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-07 21:37:47,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:37:47,304 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-07 21:37:47,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:47,367 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-07 21:37:47,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:47,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:37:47,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:47,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:37:47,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:37:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:37:47,387 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-07 21:37:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:48,342 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-01-07 21:37:48,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:37:48,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:37:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:48,344 INFO L225 Difference]: With dead ends: 117 [2019-01-07 21:37:48,345 INFO L226 Difference]: Without dead ends: 115 [2019-01-07 21:37:48,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:37:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-07 21:37:48,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-01-07 21:37:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-07 21:37:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-01-07 21:37:48,378 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-01-07 21:37:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:48,378 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-01-07 21:37:48,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:37:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-01-07 21:37:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:48,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:48,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:48,379 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-07 21:37:48,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:48,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:48,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:48,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:48,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:48,588 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:37:48,647 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-07 21:37:48,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:48,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:48,647 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:48,647 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-07 21:37:48,648 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:48,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:48,651 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:48,652 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:48,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:48,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:48,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:48,652 INFO 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-07 21:37:48,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:48,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:48,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:48,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:48,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 21 treesize of output 23 [2019-01-07 21:37:48,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:48,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:48,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:48,737 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:48,755 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:48,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:48,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:48,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:48,802 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-07 21:37:48,803 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:48,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 21:37:48,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:48,874 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-07 21:37:48,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:48,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 21:37:48,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:48,935 INFO L267 ElimStorePlain]: Start 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-07 21:37:48,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:37:48,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:48,967 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:48,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-07 21:37:48,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:49,000 INFO L267 ElimStorePlain]: Start 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-07 21:37:49,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:37:49,019 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-07 21:37:49,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:49,054 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-07 21:37:49,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:49,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:37:49,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:49,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:49,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:37:49,075 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-01-07 21:37:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:49,527 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-01-07 21:37:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:49,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:37:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:49,529 INFO L225 Difference]: With dead ends: 99 [2019-01-07 21:37:49,529 INFO L226 Difference]: Without dead ends: 98 [2019-01-07 21:37:49,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:37:49,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-07 21:37:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-01-07 21:37:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-07 21:37:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-01-07 21:37:49,553 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-01-07 21:37:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:49,553 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-01-07 21:37:49,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-01-07 21:37:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:49,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:49,554 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-07 21:37:49,554 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:49,554 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-01-07 21:37:49,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:49,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:49,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:49,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:49,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:49,718 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-07 21:37:49,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:49,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:49,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:49,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:49,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:49,719 INFO 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-07 21:37:49,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:37:49,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:37:49,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:37:49,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:49,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:49,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:49,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:49,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:49,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:49,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:49,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:49,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:49,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:49,826 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:49,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:49,854 INFO L267 ElimStorePlain]: Start 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-07 21:37:49,854 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:49,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:37:49,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:49,934 INFO L267 ElimStorePlain]: Start 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-07 21:37:49,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:49,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:49,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, 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-07 21:37:49,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:50,023 INFO L267 ElimStorePlain]: Start 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-07 21:37:50,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:50,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,066 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-07 21:37:50,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:50,117 INFO L267 ElimStorePlain]: Start 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-07 21:37:50,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:50,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:50,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-07 21:37:50,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:50,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:50,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:50,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:50,290 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-07 21:37:50,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:50,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:37:50,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:50,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:37:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:37:50,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:37:50,310 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-01-07 21:37:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:51,087 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-01-07 21:37:51,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:37:51,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-07 21:37:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:51,089 INFO L225 Difference]: With dead ends: 132 [2019-01-07 21:37:51,089 INFO L226 Difference]: Without dead ends: 130 [2019-01-07 21:37:51,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:37:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-07 21:37:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-01-07 21:37:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-07 21:37:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-01-07 21:37:51,117 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-01-07 21:37:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:51,117 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-01-07 21:37:51,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:37:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-01-07 21:37:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:51,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:51,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:51,118 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:51,119 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-01-07 21:37:51,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:51,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:51,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:51,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:51,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:51,247 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-07 21:37:51,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:51,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:51,248 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:51,248 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-07 21:37:51,249 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:51,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:51,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:51,252 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:51,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:51,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:51,252 INFO 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-07 21:37:51,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:51,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:51,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:51,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:51,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:51,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:51,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,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 25 treesize of output 51 [2019-01-07 21:37:51,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:51,399 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:51,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:51,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:51,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:51,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:51,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:51,487 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:51,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,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, 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-07 21:37:51,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:51,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:51,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:51,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:51,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:51,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:51,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-07 21:37:51,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:51,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-07 21:37:51,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:51,700 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-07 21:37:51,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:51,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:51,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:51,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:51,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:51,720 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-01-07 21:37:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:52,064 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-01-07 21:37:52,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:52,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:37:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:52,066 INFO L225 Difference]: With dead ends: 87 [2019-01-07 21:37:52,066 INFO L226 Difference]: Without dead ends: 86 [2019-01-07 21:37:52,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-07 21:37:52,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-01-07 21:37:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-07 21:37:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-01-07 21:37:52,106 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-01-07 21:37:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:52,106 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-01-07 21:37:52,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-01-07 21:37:52,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:52,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:52,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:52,107 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:52,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:52,107 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-01-07 21:37:52,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:52,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:52,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:52,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:52,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:52,238 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-07 21:37:52,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:52,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:52,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:52,239 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-01-07 21:37:52,240 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:52,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:52,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:52,242 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:52,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:52,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:52,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 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-07 21:37:52,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:52,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:52,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:52,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:52,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:52,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:52,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:52,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:52,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:52,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:52,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:52,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:52,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:52,453 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:52,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,488 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-07 21:37:52,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:52,530 INFO L267 ElimStorePlain]: Start 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-07 21:37:52,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:52,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:52,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:52,618 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-07 21:37:52,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:52,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,652 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:52,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:52,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:52,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:52,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:52,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:52,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-07 21:37:52,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:52,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:52,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:37:52,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:52,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:52,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:52,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:52,807 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-01-07 21:37:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:53,250 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-01-07 21:37:53,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:37:53,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:37:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:53,252 INFO L225 Difference]: With dead ends: 106 [2019-01-07 21:37:53,253 INFO L226 Difference]: Without dead ends: 105 [2019-01-07 21:37:53,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:37:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-07 21:37:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-01-07 21:37:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-07 21:37:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-01-07 21:37:53,296 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-01-07 21:37:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:53,296 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-01-07 21:37:53,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-01-07 21:37:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:53,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:53,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:53,297 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:53,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:53,297 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-07 21:37:53,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:53,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:53,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:53,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:53,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:53,439 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:37:53,501 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-07 21:37:53,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:53,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:53,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:53,502 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-07 21:37:53,504 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:53,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:53,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:53,508 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:53,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:53,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:53,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:53,508 INFO 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-07 21:37:53,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:53,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:53,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:53,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:53,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:53,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:53,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:53,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:53,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:53,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:53,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:53,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:53,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:53,658 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-07 21:37:53,658 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:53,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,691 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-07 21:37:53,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:53,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:53,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:53,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,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, 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-07 21:37:53,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:53,818 INFO L267 ElimStorePlain]: Start 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-07 21:37:53,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:53,857 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:53,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:37:53,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:53,914 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-07 21:37:53,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:53,937 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-07 21:37:53,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:53,975 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-07 21:37:53,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:53,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:37:53,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:53,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:53,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:37:53,996 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-01-07 21:37:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:54,514 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-01-07 21:37:54,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:54,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:37:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:54,521 INFO L225 Difference]: With dead ends: 102 [2019-01-07 21:37:54,521 INFO L226 Difference]: Without dead ends: 101 [2019-01-07 21:37:54,521 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-07 21:37:54,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-07 21:37:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-01-07 21:37:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-07 21:37:54,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-07 21:37:54,555 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-07 21:37:54,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:54,555 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-07 21:37:54,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:54,556 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-07 21:37:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:54,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:54,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:54,556 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:54,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:54,556 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-01-07 21:37:54,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:54,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:54,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:54,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:54,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:54,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-07 21:37:54,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:54,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:54,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:54,655 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-07 21:37:54,656 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:54,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:54,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:54,658 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:54,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:54,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:54,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:54,659 INFO 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-07 21:37:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:54,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:54,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:54,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:54,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:54,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:54,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:54,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:54,720 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:54,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:54,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:54,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:54,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:54,786 INFO L267 ElimStorePlain]: Start 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-07 21:37:54,787 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:54,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:37:54,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:54,981 INFO L267 ElimStorePlain]: Start 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-07 21:37:54,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:54,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:54,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,005 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:55,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:37:55,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:55,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-07 21:37:55,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:37:55,053 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-07 21:37:55,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:55,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:55,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:37:55,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:55,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:55,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:55,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:55,095 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-01-07 21:37:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:55,372 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-01-07 21:37:55,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:37:55,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:37:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:55,373 INFO L225 Difference]: With dead ends: 94 [2019-01-07 21:37:55,373 INFO L226 Difference]: Without dead ends: 93 [2019-01-07 21:37:55,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:37:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-07 21:37:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-01-07 21:37:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-07 21:37:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-07 21:37:55,421 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-07 21:37:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:55,421 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-07 21:37:55,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-07 21:37:55,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:55,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:55,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:55,422 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-01-07 21:37:55,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:55,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:55,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:55,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:55,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:55,776 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-07 21:37:55,827 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-07 21:37:55,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:55,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:55,828 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:55,828 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-01-07 21:37:55,831 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:55,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:55,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:55,834 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:37:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:55,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:55,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:55,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:55,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:55,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:55,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:55,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 18 treesize of output 21 [2019-01-07 21:37:55,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:55,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:37:55,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:37:55,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:55,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:37:55,975 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:55,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:56,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:56,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:56,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:56,064 INFO L267 ElimStorePlain]: Start 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-07 21:37:56,065 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:37:56,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:37:56,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:56,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:56,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:37:56,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,215 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:56,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-07 21:37:56,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:56,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:56,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-07 21:37:56,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:56,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-07 21:37:56,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:56,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-07 21:37:56,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:37:56,321 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-07 21:37:56,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:56,357 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-07 21:37:56,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:56,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:37:56,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:56,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:37:56,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:37:56,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:37:56,378 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-01-07 21:37:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:56,774 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-01-07 21:37:56,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:37:56,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:37:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:56,776 INFO L225 Difference]: With dead ends: 116 [2019-01-07 21:37:56,776 INFO L226 Difference]: Without dead ends: 115 [2019-01-07 21:37:56,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:37:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-07 21:37:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-01-07 21:37:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-07 21:37:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-01-07 21:37:56,820 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-01-07 21:37:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:56,820 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-01-07 21:37:56,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:37:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-01-07 21:37:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:56,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:56,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:56,821 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:56,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:56,821 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-01-07 21:37:56,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:56,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:56,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:56,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:56,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:56,986 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-07 21:37:56,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:56,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:56,986 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:56,986 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-01-07 21:37:56,987 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:56,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:56,991 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:56,991 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:37:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:56,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:56,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:56,992 INFO 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-07 21:37:57,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:57,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:57,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:57,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:57,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:57,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:37:57,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:57,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:57,047 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:57,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:57,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:57,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:57,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:57,135 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-07 21:37:57,135 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:57,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:37:57,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:57,246 INFO L267 ElimStorePlain]: Start 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-07 21:37:57,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:57,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:37:57,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:57,332 INFO L267 ElimStorePlain]: Start 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-07 21:37:57,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:57,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,385 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:57,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:37:57,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:57,435 INFO L267 ElimStorePlain]: Start 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-07 21:37:57,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:37:57,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,469 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:57,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:57,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, 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-07 21:37:57,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:57,539 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-07 21:37:57,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:37:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:57,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:57,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:57,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:37:57,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:57,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:37:57,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:37:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:37:57,636 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-01-07 21:37:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:58,574 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-01-07 21:37:58,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:37:58,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:37:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:58,576 INFO L225 Difference]: With dead ends: 140 [2019-01-07 21:37:58,576 INFO L226 Difference]: Without dead ends: 139 [2019-01-07 21:37:58,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:37:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-07 21:37:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-01-07 21:37:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-07 21:37:58,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-01-07 21:37:58,624 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-01-07 21:37:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:58,624 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-01-07 21:37:58,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:37:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-01-07 21:37:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:58,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:58,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:58,625 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-01-07 21:37:58,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:58,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:58,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:58,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:58,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:58,734 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-07 21:37:58,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:58,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:58,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:37:58,735 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-07 21:37:58,735 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:37:58,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:37:58,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:37:58,738 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:37:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:58,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:37:58,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:58,738 INFO 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-07 21:37:58,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:58,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:58,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:58,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:58,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:37:58,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:37:58,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:37:58,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:37:58,790 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:58,804 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:58,814 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:58,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:58,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:58,848 INFO L267 ElimStorePlain]: Start 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-07 21:37:58,849 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-07 21:37:58,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-07 21:37:58,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:58,894 INFO L267 ElimStorePlain]: Start 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-07 21:37:58,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:37:58,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:58,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:37:58,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:58,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:58,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:37:58,946 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-07 21:37:58,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:58,958 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-07 21:37:58,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:58,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:37:58,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:58,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:37:58,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:37:58,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:37:58,979 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-01-07 21:37:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:59,251 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-01-07 21:37:59,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:37:59,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:37:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:59,253 INFO L225 Difference]: With dead ends: 112 [2019-01-07 21:37:59,253 INFO L226 Difference]: Without dead ends: 111 [2019-01-07 21:37:59,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:37:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-07 21:37:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-01-07 21:37:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-07 21:37:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-01-07 21:37:59,304 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-01-07 21:37:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:59,304 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-01-07 21:37:59,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:37:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-01-07 21:37:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:37:59,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:59,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:37:59,305 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:37:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:59,305 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-01-07 21:37:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:59,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:59,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:59,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:59,514 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:37:59,599 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-07 21:37:59,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:59,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:59,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:59,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:59,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:59,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:37:59,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:37:59,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:37:59,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:37:59,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:59,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:59,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:37:59,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:37:59,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,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 23 treesize of output 37 [2019-01-07 21:37:59,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:37:59,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:37:59,708 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:59,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:59,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:59,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:59,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:59,802 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-07 21:37:59,803 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:37:59,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,848 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-07 21:37:59,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:59,896 INFO L267 ElimStorePlain]: Start 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-07 21:37:59,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:37:59,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:37:59,940 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:37:59,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 80 [2019-01-07 21:37:59,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:59,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:37:59,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:00,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:00,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:00,096 INFO L267 ElimStorePlain]: Start 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-07 21:38:00,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:00,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:00,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:00,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:00,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:00,197 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-07 21:38:00,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:00,326 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-07 21:38:00,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:00,384 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-07 21:38:00,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:00,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:38:00,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:00,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:00,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:00,405 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-01-07 21:38:01,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:01,378 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-01-07 21:38:01,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:01,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:38:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:01,381 INFO L225 Difference]: With dead ends: 137 [2019-01-07 21:38:01,381 INFO L226 Difference]: Without dead ends: 135 [2019-01-07 21:38:01,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-07 21:38:01,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-01-07 21:38:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:38:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-01-07 21:38:01,422 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-01-07 21:38:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:01,423 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-01-07 21:38:01,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-01-07 21:38:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:01,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:01,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:01,424 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:01,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:01,424 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-07 21:38:01,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:01,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:01,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:01,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:01,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:38:01,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:01,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:01,533 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:38:01,533 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-07 21:38:01,534 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:01,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:01,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:01,536 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:01,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:01,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:01,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:01,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:01,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:01,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:01,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:01,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:01,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:01,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:01,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:01,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:01,592 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:01,620 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:01,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:01,646 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:01,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:01,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:01,676 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:01,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,708 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-07 21:38:01,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:01,750 INFO L267 ElimStorePlain]: Start 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-07 21:38:01,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:01,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,783 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:01,784 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-07 21:38:01,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:01,832 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-07 21:38:01,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:01,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:01,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:01,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:01,917 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-07 21:38:01,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:01,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-07 21:38:01,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:01,961 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-07 21:38:01,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:01,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:38:01,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:01,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:01,981 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-01-07 21:38:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:02,463 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-07 21:38:02,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:02,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:38:02,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:02,465 INFO L225 Difference]: With dead ends: 124 [2019-01-07 21:38:02,465 INFO L226 Difference]: Without dead ends: 123 [2019-01-07 21:38:02,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:02,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-07 21:38:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-01-07 21:38:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-07 21:38:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-01-07 21:38:02,512 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-01-07 21:38:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:02,512 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-01-07 21:38:02,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-01-07 21:38:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:02,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:02,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:02,513 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:02,513 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-07 21:38:02,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:02,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:02,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:02,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:02,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:02,654 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-07 21:38:02,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:02,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:02,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:38:02,655 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-07 21:38:02,656 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:02,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:02,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:02,659 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:02,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:02,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:02,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:02,659 INFO 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-07 21:38:02,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:02,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:02,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:02,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:02,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:02,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:02,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:02,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:02,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:02,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:02,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:02,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:02,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:02,786 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-07 21:38:02,786 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:02,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,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, 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-07 21:38:02,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:02,859 INFO L267 ElimStorePlain]: Start 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-07 21:38:02,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:02,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,895 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:02,895 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-07 21:38:02,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:02,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:02,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:02,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:02,974 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:02,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, 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-07 21:38:02,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:03,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:03,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:03,043 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-07 21:38:03,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:03,081 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-07 21:38:03,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:03,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:38:03,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:03,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:38:03,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:38:03,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:03,100 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-01-07 21:38:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:03,593 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-01-07 21:38:03,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:38:03,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-07 21:38:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:03,595 INFO L225 Difference]: With dead ends: 119 [2019-01-07 21:38:03,596 INFO L226 Difference]: Without dead ends: 118 [2019-01-07 21:38:03,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-07 21:38:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-01-07 21:38:03,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-07 21:38:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-01-07 21:38:03,649 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-01-07 21:38:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:03,649 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-01-07 21:38:03,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:38:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-01-07 21:38:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:03,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:03,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:03,650 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-01-07 21:38:03,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:03,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:03,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:03,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:03,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:03,810 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-07 21:38:03,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:03,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:03,811 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:38:03,811 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-01-07 21:38:03,812 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:03,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:03,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:03,813 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:38:03,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:03,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:03,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:03,814 INFO 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-07 21:38:03,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:03,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:03,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:03,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:03,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:03,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:03,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:03,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:03,865 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:03,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:03,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:03,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:03,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:03,945 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-07 21:38:03,946 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:03,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:03,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:38:03,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:04,023 INFO L267 ElimStorePlain]: Start 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-07 21:38:04,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:04,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:38:04,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:04,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:04,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:04,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,142 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:04,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-07 21:38:04,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:04,191 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-07 21:38:04,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:04,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:04,246 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:04,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, 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-07 21:38:04,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:04,294 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-07 21:38:04,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:04,311 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-07 21:38:04,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:04,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:04,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:38:04,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:04,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:04,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:04,393 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-01-07 21:38:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:05,402 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-01-07 21:38:05,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:05,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:38:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:05,404 INFO L225 Difference]: With dead ends: 149 [2019-01-07 21:38:05,404 INFO L226 Difference]: Without dead ends: 148 [2019-01-07 21:38:05,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:38:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-07 21:38:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-01-07 21:38:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-07 21:38:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-01-07 21:38:05,461 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-01-07 21:38:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:05,462 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-01-07 21:38:05,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-01-07 21:38:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:05,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:05,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:05,463 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-01-07 21:38:05,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:05,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:05,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:05,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:05,604 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-07 21:38:05,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:05,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:05,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:38:05,605 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-07 21:38:05,607 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:05,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:05,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:05,610 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:05,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:05,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:05,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:05,611 INFO 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-07 21:38:05,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:05,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:05,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:05,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 18 treesize of output 21 [2019-01-07 21:38:05,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:05,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:05,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:05,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:05,674 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:05,694 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:05,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:05,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:05,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:05,741 INFO L267 ElimStorePlain]: Start 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-07 21:38:05,741 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:05,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:38:05,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:05,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:05,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:05,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-07 21:38:05,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:05,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:05,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:05,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:05,897 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:05,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:38:05,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:05,929 INFO L267 ElimStorePlain]: Start 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-07 21:38:05,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:38:05,948 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-07 21:38:05,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:05,980 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-07 21:38:05,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:05,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:38:05,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:05,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:06,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:06,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:38:06,000 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-01-07 21:38:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:06,574 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-01-07 21:38:06,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:38:06,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:38:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:06,576 INFO L225 Difference]: With dead ends: 139 [2019-01-07 21:38:06,576 INFO L226 Difference]: Without dead ends: 138 [2019-01-07 21:38:06,577 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-07 21:38:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-07 21:38:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-01-07 21:38:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-07 21:38:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-01-07 21:38:06,637 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-01-07 21:38:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:06,637 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-01-07 21:38:06,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-01-07 21:38:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:06,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:06,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:06,638 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:06,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-01-07 21:38:06,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:06,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:06,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:06,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:06,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:06,816 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-07 21:38:06,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:06,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:06,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:06,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:06,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:06,816 INFO 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-07 21:38:06,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:06,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:06,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:38:06,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:06,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:06,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:06,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:06,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:06,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:06,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:06,871 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:06,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:06,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:06,926 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:06,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:06,954 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-07 21:38:06,954 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:06,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:06,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, 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-07 21:38:06,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:07,032 INFO L267 ElimStorePlain]: Start 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-07 21:38:07,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:07,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,076 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:07,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:38:07,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:07,122 INFO L267 ElimStorePlain]: Start 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-07 21:38:07,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,163 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:07,164 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-07 21:38:07,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:07,227 INFO L267 ElimStorePlain]: Start 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-07 21:38:07,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:07,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:07,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:07,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:07,314 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-07 21:38:07,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:07,337 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-07 21:38:07,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:07,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:07,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:38:07,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:07,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:07,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:07,412 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-01-07 21:38:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:08,219 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-01-07 21:38:08,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:08,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:38:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:08,222 INFO L225 Difference]: With dead ends: 164 [2019-01-07 21:38:08,222 INFO L226 Difference]: Without dead ends: 163 [2019-01-07 21:38:08,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-07 21:38:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-01-07 21:38:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-07 21:38:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-01-07 21:38:08,283 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-01-07 21:38:08,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:08,283 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-01-07 21:38:08,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-01-07 21:38:08,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:08,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:08,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:08,284 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-07 21:38:08,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:08,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:08,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:08,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:08,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:08,447 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-07 21:38:08,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:08,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:08,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:38:08,447 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-01-07 21:38:08,448 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:08,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:08,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:08,450 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:38:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:08,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:08,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:08,451 INFO 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-07 21:38:08,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:08,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:08,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:08,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:08,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:08,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:08,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:08,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:08,491 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:08,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:08,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:08,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:08,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:08,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:08,573 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:08,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,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, 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-07 21:38:08,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:08,645 INFO L267 ElimStorePlain]: Start 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-07 21:38:08,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:08,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:08,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:08,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:08,730 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-07 21:38:08,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:08,751 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-07 21:38:08,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:08,772 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-07 21:38:08,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:08,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:38:08,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:08,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:38:08,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:38:08,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:38:08,791 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-01-07 21:38:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:09,160 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-01-07 21:38:09,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:38:09,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:38:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:09,162 INFO L225 Difference]: With dead ends: 122 [2019-01-07 21:38:09,162 INFO L226 Difference]: Without dead ends: 121 [2019-01-07 21:38:09,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-07 21:38:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-01-07 21:38:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-07 21:38:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-01-07 21:38:09,236 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-01-07 21:38:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:09,236 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-01-07 21:38:09,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:38:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-01-07 21:38:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:09,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:09,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:09,237 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:09,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:09,237 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-01-07 21:38:09,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:09,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:09,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:09,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:09,355 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-07 21:38:09,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:09,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:09,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:38:09,355 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-01-07 21:38:09,356 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:09,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:09,359 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:09,359 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:09,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:09,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:09,360 INFO 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-07 21:38:09,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:09,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:09,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:09,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:09,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:09,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:09,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:09,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:09,413 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:09,445 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:09,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:09,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:09,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:09,500 INFO L267 ElimStorePlain]: Start 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-07 21:38:09,501 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:09,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,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, 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-07 21:38:09,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:09,575 INFO L267 ElimStorePlain]: Start 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-07 21:38:09,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:09,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,610 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:09,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:38:09,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:09,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:09,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:09,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:09,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:09,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:09,745 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-07 21:38:09,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:09,766 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-07 21:38:09,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:09,792 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-07 21:38:09,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:09,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:38:09,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:09,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:09,812 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-01-07 21:38:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:10,381 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-01-07 21:38:10,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:10,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:38:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:10,383 INFO L225 Difference]: With dead ends: 154 [2019-01-07 21:38:10,383 INFO L226 Difference]: Without dead ends: 153 [2019-01-07 21:38:10,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-07 21:38:10,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-07 21:38:10,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-07 21:38:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-07 21:38:10,464 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-07 21:38:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:10,465 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-07 21:38:10,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-07 21:38:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:10,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:10,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:10,465 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-01-07 21:38:10,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:10,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:10,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:10,944 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-07 21:38:10,970 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-07 21:38:10,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:10,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:10,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:38:10,971 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-07 21:38:10,972 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:10,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:10,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:10,975 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:38:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:10,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:10,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:10,977 INFO 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-07 21:38:10,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:10,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:11,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:11,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:11,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:11,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:11,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:11,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:11,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:11,052 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:11,063 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:11,073 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:11,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:11,099 INFO L267 ElimStorePlain]: Start 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-07 21:38:11,100 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:11,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:38:11,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:11,165 INFO L267 ElimStorePlain]: Start 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-07 21:38:11,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:11,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-07 21:38:11,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:11,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:11,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:38:11,286 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-07 21:38:11,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:11,321 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-07 21:38:11,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:11,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:38:11,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:11,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:38:11,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:38:11,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:38:11,340 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-01-07 21:38:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:11,711 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-01-07 21:38:11,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:38:11,712 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:38:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:11,714 INFO L225 Difference]: With dead ends: 130 [2019-01-07 21:38:11,714 INFO L226 Difference]: Without dead ends: 129 [2019-01-07 21:38:11,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-07 21:38:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-01-07 21:38:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-07 21:38:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-07 21:38:11,796 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-07 21:38:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:11,797 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-07 21:38:11,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:38:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-07 21:38:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:11,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:11,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:11,798 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:11,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:11,798 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-01-07 21:38:11,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:11,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:11,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:11,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:11,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:11,948 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-07 21:38:11,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:11,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:11,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:11,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:11,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:11,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 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-07 21:38:11,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:11,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:11,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:38:11,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:11,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:11,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:11,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:11,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:11,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:11,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:11,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:11,992 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:12,019 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:12,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:12,045 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:12,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:12,074 INFO L267 ElimStorePlain]: Start 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-07 21:38:12,075 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,109 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-07 21:38:12,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:12,163 INFO L267 ElimStorePlain]: Start 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-07 21:38:12,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:12,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:38:12,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:12,268 INFO L267 ElimStorePlain]: Start 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-07 21:38:12,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:12,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:12,310 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:12,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, 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-07 21:38:12,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:12,357 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-07 21:38:12,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:12,381 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-07 21:38:12,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:12,412 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-07 21:38:12,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:12,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:38:12,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:12,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:38:12,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:38:12,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:12,432 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-01-07 21:38:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:12,955 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-01-07 21:38:12,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:38:12,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-07 21:38:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:12,958 INFO L225 Difference]: With dead ends: 160 [2019-01-07 21:38:12,958 INFO L226 Difference]: Without dead ends: 159 [2019-01-07 21:38:12,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:38:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-07 21:38:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-01-07 21:38:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-07 21:38:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-01-07 21:38:13,059 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-01-07 21:38:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:13,060 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-01-07 21:38:13,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:38:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-01-07 21:38:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:13,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:13,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:13,061 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:13,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:13,061 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-01-07 21:38:13,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:13,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:13,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:13,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:13,150 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-07 21:38:13,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:13,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:13,151 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:38:13,151 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-01-07 21:38:13,154 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:13,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:13,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:13,157 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:38:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:13,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:13,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:13,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 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-07 21:38:13,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:13,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:13,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:13,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:13,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 21 treesize of output 23 [2019-01-07 21:38:13,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:13,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:13,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:13,209 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,229 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,276 INFO L267 ElimStorePlain]: Start 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-07 21:38:13,277 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:13,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:38:13,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,347 INFO L267 ElimStorePlain]: Start 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-07 21:38:13,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:13,363 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-07 21:38:13,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:13,373 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-07 21:38:13,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:38:13,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 21:38:13,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:38:13,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:38:13,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:38:13,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:38:13,393 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-01-07 21:38:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:13,495 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-01-07 21:38:13,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:38:13,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-07 21:38:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:13,497 INFO L225 Difference]: With dead ends: 121 [2019-01-07 21:38:13,497 INFO L226 Difference]: Without dead ends: 117 [2019-01-07 21:38:13,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:38:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-07 21:38:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-01-07 21:38:13,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-07 21:38:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-01-07 21:38:13,577 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-01-07 21:38:13,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:13,577 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-01-07 21:38:13,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:38:13,577 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-01-07 21:38:13,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:13,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:13,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:13,578 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:13,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:13,578 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-01-07 21:38:13,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:13,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:13,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:13,778 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-07 21:38:13,856 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-07 21:38:13,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:13,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:13,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:13,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:13,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:13,857 INFO 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-07 21:38:13,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:13,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:13,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:38:13,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:13,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:13,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:13,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:13,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,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 23 treesize of output 37 [2019-01-07 21:38:13,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:13,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:13,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:13,900 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,938 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:13,993 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-07 21:38:13,993 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:14,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,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, 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-07 21:38:14,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:14,074 INFO L267 ElimStorePlain]: Start 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-07 21:38:14,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:14,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:14,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:14,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-07 21:38:14,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:14,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,204 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:14,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-07 21:38:14,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:14,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:14,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:14,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:14,432 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:14,432 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-01-07 21:38:14,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-07 21:38:14,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:14,578 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-07 21:38:14,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:14,602 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-07 21:38:14,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:14,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:14,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:38:14,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:14,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:14,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:14,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:14,678 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-01-07 21:38:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:15,599 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-01-07 21:38:15,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:15,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:38:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:15,603 INFO L225 Difference]: With dead ends: 186 [2019-01-07 21:38:15,603 INFO L226 Difference]: Without dead ends: 184 [2019-01-07 21:38:15,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-07 21:38:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-01-07 21:38:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-07 21:38:15,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-01-07 21:38:15,714 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-01-07 21:38:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:15,714 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-01-07 21:38:15,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-01-07 21:38:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:15,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:15,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:15,715 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-01-07 21:38:15,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:15,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:15,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:15,882 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-07 21:38:15,908 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-07 21:38:15,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:15,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:15,908 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 21:38:15,909 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-01-07 21:38:15,909 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:15,909 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:15,911 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:15,912 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:38:15,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:15,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:15,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:15,912 INFO 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-07 21:38:15,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:15,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:15,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:15,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:15,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:15,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:15,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:15,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:15,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:15,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:15,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:15,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:15,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:15,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:15,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:15,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:15,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:15,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:16,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:16,026 INFO L267 ElimStorePlain]: Start 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-07 21:38:16,026 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:16,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:38:16,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:16,087 INFO L267 ElimStorePlain]: Start 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-07 21:38:16,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:16,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-07 21:38:16,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:16,144 INFO L267 ElimStorePlain]: Start 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-07 21:38:16,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:38:16,162 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-07 21:38:16,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:16,172 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-07 21:38:16,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:16,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:38:16,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:16,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:38:16,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:38:16,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:38:16,192 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-01-07 21:38:16,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:16,612 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-01-07 21:38:16,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:38:16,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:38:16,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:16,615 INFO L225 Difference]: With dead ends: 161 [2019-01-07 21:38:16,615 INFO L226 Difference]: Without dead ends: 160 [2019-01-07 21:38:16,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:38:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-07 21:38:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-01-07 21:38:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-07 21:38:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-01-07 21:38:16,703 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-01-07 21:38:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:16,703 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-01-07 21:38:16,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:38:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-01-07 21:38:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:16,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:16,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:16,704 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:16,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-01-07 21:38:16,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:16,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:16,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:16,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:16,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:16,864 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-07 21:38:16,887 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-07 21:38:16,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:16,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:16,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:16,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:16,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:16,887 INFO 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-07 21:38:16,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:16,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:16,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 21:38:16,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:16,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:16,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:16,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:16,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:38:16,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:38:16,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:16,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:38:16,937 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:16,953 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:16,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:16,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:16,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:16,996 INFO L267 ElimStorePlain]: Start 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-07 21:38:16,996 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-07 21:38:17,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-07 21:38:17,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:17,044 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-07 21:38:17,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:38:17,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:17,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:38:17,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:17,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:17,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:38:17,099 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-07 21:38:17,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:17,118 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-07 21:38:17,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:17,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:38:17,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:17,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:38:17,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:38:17,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:38:17,137 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-01-07 21:38:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:17,501 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-01-07 21:38:17,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:38:17,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-07 21:38:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:17,504 INFO L225 Difference]: With dead ends: 172 [2019-01-07 21:38:17,504 INFO L226 Difference]: Without dead ends: 170 [2019-01-07 21:38:17,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:38:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-07 21:38:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-01-07 21:38:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-07 21:38:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-01-07 21:38:17,605 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-01-07 21:38:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:17,606 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-01-07 21:38:17,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:38:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-01-07 21:38:17,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:17,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:17,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:17,607 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:17,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:17,607 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-01-07 21:38:17,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:17,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:17,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:17,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:17,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:17,920 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:38:18,010 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-07 21:38:18,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:18,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:18,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:18,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:18,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:18,011 INFO 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-07 21:38:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:38:18,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:38:18,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:38:18,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:18,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:18,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:18,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:18,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:18,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:18,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:18,058 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,086 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:18,140 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:18,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:38:18,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:18,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:18,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,262 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:18,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:38:18,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,308 INFO L267 ElimStorePlain]: Start 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-07 21:38:18,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:18,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,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, 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-07 21:38:18,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,396 INFO L267 ElimStorePlain]: Start 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-07 21:38:18,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:18,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,436 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:18,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:18,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:38:18,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:18,487 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-07 21:38:18,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:18,517 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-07 21:38:18,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:18,579 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-07 21:38:18,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:18,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:38:18,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:18,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:18,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:18,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:18,599 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-01-07 21:38:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:19,399 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-01-07 21:38:19,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:19,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-07 21:38:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:19,402 INFO L225 Difference]: With dead ends: 209 [2019-01-07 21:38:19,402 INFO L226 Difference]: Without dead ends: 207 [2019-01-07 21:38:19,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-07 21:38:19,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-01-07 21:38:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-07 21:38:19,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-01-07 21:38:19,493 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-01-07 21:38:19,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:19,494 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-01-07 21:38:19,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-01-07 21:38:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:38:19,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:19,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 21:38:19,494 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-01-07 21:38:19,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:19,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:19,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:19,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:19,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:19,602 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-07 21:38:19,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:19,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:19,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:19,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:19,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:19,603 INFO 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-07 21:38:19,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:19,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:19,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:38:19,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:19,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:19,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:19,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:19,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:19,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:19,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:19,665 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:19,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:19,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:19,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:19,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:19,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:19,733 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:19,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:38:19,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:19,796 INFO L267 ElimStorePlain]: Start 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-07 21:38:19,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:19,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,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 31 treesize of output 65 [2019-01-07 21:38:19,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:19,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-07 21:38:19,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:19,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:19,924 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:19,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-07 21:38:19,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:19,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:19,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:38:19,985 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-07 21:38:19,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:20,052 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-07 21:38:20,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:20,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:38:20,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:20,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:20,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:20,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:20,072 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-01-07 21:38:20,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:20,575 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-01-07 21:38:20,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:20,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 21:38:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:20,577 INFO L225 Difference]: With dead ends: 180 [2019-01-07 21:38:20,577 INFO L226 Difference]: Without dead ends: 173 [2019-01-07 21:38:20,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:38:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-07 21:38:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-01-07 21:38:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-07 21:38:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-01-07 21:38:20,700 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-01-07 21:38:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:20,701 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-01-07 21:38:20,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-01-07 21:38:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:20,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:20,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:20,702 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:20,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-01-07 21:38:20,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:20,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:20,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:20,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:20,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:21,302 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:38:21,377 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-07 21:38:21,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:21,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:21,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:21,377 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-07 21:38:21,378 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:21,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:21,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:21,380 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:38:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:21,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:21,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:21,381 INFO 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-07 21:38:21,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:21,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:21,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:21,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:21,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:21,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:21,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:21,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:21,422 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:21,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:21,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:21,493 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:21,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:21,527 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-07 21:38:21,527 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:21,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:38:21,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:21,623 INFO L267 ElimStorePlain]: Start 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-07 21:38:21,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:21,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,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 38 treesize of output 80 [2019-01-07 21:38:21,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:21,722 INFO L267 ElimStorePlain]: Start 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-07 21:38:21,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:21,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,780 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:21,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:21,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:21,841 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-07 21:38:21,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:21,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:21,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:21,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:38:21,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:21,932 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-07 21:38:21,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:21,953 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-07 21:38:21,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:22,166 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-07 21:38:22,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:22,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:38:22,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:22,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:22,186 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-01-07 21:38:23,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:23,000 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-01-07 21:38:23,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:38:23,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:38:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:23,003 INFO L225 Difference]: With dead ends: 189 [2019-01-07 21:38:23,003 INFO L226 Difference]: Without dead ends: 188 [2019-01-07 21:38:23,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:23,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-07 21:38:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-01-07 21:38:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-07 21:38:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-01-07 21:38:23,114 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-01-07 21:38:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:23,114 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-01-07 21:38:23,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-01-07 21:38:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:23,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:23,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:23,115 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:23,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:23,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-07 21:38:23,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:23,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:23,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:23,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:23,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:23,325 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-07 21:38:23,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:23,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:23,326 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:23,326 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-07 21:38:23,327 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:23,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:23,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:23,330 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:38:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:23,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:23,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:23,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:23,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:23,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:23,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:23,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 18 treesize of output 21 [2019-01-07 21:38:23,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:23,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:23,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:23,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:23,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,472 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:23,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,506 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-07 21:38:23,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,555 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-07 21:38:23,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:23,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:23,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,639 INFO L267 ElimStorePlain]: Start 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-07 21:38:23,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:23,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,683 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:23,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:23,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,732 INFO L267 ElimStorePlain]: Start 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-07 21:38:23,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:23,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:23,770 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:23,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, 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-07 21:38:23,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:23,820 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-07 21:38:23,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:23,843 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-07 21:38:23,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:23,898 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-07 21:38:23,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:23,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:38:23,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:23,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:38:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:38:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:23,918 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-01-07 21:38:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:24,732 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-01-07 21:38:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:38:24,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-07 21:38:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:24,735 INFO L225 Difference]: With dead ends: 169 [2019-01-07 21:38:24,735 INFO L226 Difference]: Without dead ends: 168 [2019-01-07 21:38:24,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-07 21:38:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-01-07 21:38:24,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-07 21:38:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-01-07 21:38:24,837 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-01-07 21:38:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:24,838 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-01-07 21:38:24,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:38:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-01-07 21:38:24,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:24,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:24,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:24,838 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:24,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-07 21:38:24,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:24,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:24,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:24,936 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-07 21:38:24,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:24,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:24,937 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:24,937 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-07 21:38:24,938 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:24,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:24,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:24,942 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:38:24,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:24,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:24,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:24,943 INFO 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-07 21:38:24,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:24,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:24,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:24,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:24,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:24,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:38:24,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, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-07 21:38:24,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:25,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-07 21:38:25,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:25,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:25,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:25,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:25,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:25,089 INFO L267 ElimStorePlain]: Start 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-07 21:38:25,089 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-07 21:38:25,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:25,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:25,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-07 21:38:25,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:25,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:25,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-07 21:38:25,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:25,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:25,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:25,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:25,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:25,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:25,148 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-07 21:38:25,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-07 21:38:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:25,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:25,182 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-07 21:38:25,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:25,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:38:25,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:25,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:38:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:38:25,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:38:25,200 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-01-07 21:38:25,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:25,490 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-01-07 21:38:25,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:38:25,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-07 21:38:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:25,492 INFO L225 Difference]: With dead ends: 159 [2019-01-07 21:38:25,492 INFO L226 Difference]: Without dead ends: 158 [2019-01-07 21:38:25,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:38:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-07 21:38:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-01-07 21:38:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-07 21:38:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-01-07 21:38:25,586 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-01-07 21:38:25,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:25,586 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-01-07 21:38:25,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:38:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-01-07 21:38:25,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:25,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:25,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:25,587 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:25,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:25,587 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-01-07 21:38:25,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:25,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:25,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:25,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:25,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:25,902 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-07 21:38:26,017 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-07 21:38:26,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:26,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:26,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:26,017 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-01-07 21:38:26,018 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:26,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:26,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:26,020 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-07 21:38:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:26,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:26,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:26,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:26,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:26,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:26,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:26,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:26,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:26,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:26,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:26,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:26,091 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,173 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:26,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:38:26,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,249 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-07 21:38:26,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:26,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:26,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:26,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:26,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,372 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:26,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-07 21:38:26,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:26,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:26,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,465 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:26,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:26,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,518 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-07 21:38:26,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:38:26,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:26,598 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:26,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:38:26,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:26,676 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-07 21:38:26,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:38:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:26,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:26,849 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-07 21:38:26,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-07 21:38:26,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:26,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:38:26,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:38:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:38:26,869 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-01-07 21:38:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:28,183 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-01-07 21:38:28,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:38:28,184 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-07 21:38:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:28,186 INFO L225 Difference]: With dead ends: 199 [2019-01-07 21:38:28,186 INFO L226 Difference]: Without dead ends: 198 [2019-01-07 21:38:28,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:38:28,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-07 21:38:28,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-01-07 21:38:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-07 21:38:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-07 21:38:28,311 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-07 21:38:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:28,312 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-07 21:38:28,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:38:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-07 21:38:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:28,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:28,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:28,313 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:28,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-01-07 21:38:28,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:28,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:28,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:28,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:28,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:28,511 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-07 21:38:28,582 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-07 21:38:28,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:28,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:28,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:28,582 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-01-07 21:38:28,583 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:28,583 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:28,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:28,587 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:38:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:28,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:28,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:28,588 INFO 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-07 21:38:28,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:28,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:28,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:28,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:28,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:28,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:28,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:28,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:28,647 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:28,714 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:28,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-07 21:38:28,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,787 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-07 21:38:28,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:28,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 21:38:28,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,847 INFO L267 ElimStorePlain]: Start 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-07 21:38:28,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:38:28,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:28,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-07 21:38:28,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,912 INFO L267 ElimStorePlain]: Start 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-07 21:38:28,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-07 21:38:28,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:28,943 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:28,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, 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-07 21:38:28,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,976 INFO L267 ElimStorePlain]: Start 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-07 21:38:28,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:38:28,997 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-07 21:38:28,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:29,050 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-07 21:38:29,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:29,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:38:29,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:29,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:29,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:29,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:29,070 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-01-07 21:38:29,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:29,745 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-01-07 21:38:29,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:29,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:38:29,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:29,748 INFO L225 Difference]: With dead ends: 181 [2019-01-07 21:38:29,748 INFO L226 Difference]: Without dead ends: 180 [2019-01-07 21:38:29,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-07 21:38:29,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-01-07 21:38:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-07 21:38:29,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-07 21:38:29,867 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-07 21:38:29,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:29,868 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-07 21:38:29,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:29,868 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-07 21:38:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:29,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:29,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:29,869 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:29,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:29,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-01-07 21:38:29,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:29,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:29,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:30,093 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-07 21:38:30,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:30,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:30,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:30,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:30,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:30,094 INFO 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-07 21:38:30,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:30,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:30,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:38:30,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:30,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:30,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:30,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:30,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:30,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,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 25 treesize of output 51 [2019-01-07 21:38:30,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:30,141 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,167 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,222 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:30,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,268 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-07 21:38:30,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:30,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:30,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:30,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,422 INFO L267 ElimStorePlain]: Start 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-07 21:38:30,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:30,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,466 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:30,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:30,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:30,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:30,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,558 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:30,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-07 21:38:30,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:30,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:30,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,646 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:30,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:30,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-07 21:38:30,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:30,694 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-07 21:38:30,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:30,719 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-07 21:38:30,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:30,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:30,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-07 21:38:30,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:30,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:38:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:38:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:30,821 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-01-07 21:38:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:32,207 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-01-07 21:38:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:38:32,207 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-07 21:38:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:32,210 INFO L225 Difference]: With dead ends: 200 [2019-01-07 21:38:32,210 INFO L226 Difference]: Without dead ends: 199 [2019-01-07 21:38:32,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-01-07 21:38:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-07 21:38:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-01-07 21:38:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-07 21:38:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-01-07 21:38:32,316 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-01-07 21:38:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:32,316 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-01-07 21:38:32,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:38:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-01-07 21:38:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:32,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:32,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:32,317 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:32,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-01-07 21:38:32,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:32,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:32,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:32,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:32,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:32,468 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-07 21:38:32,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:32,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:32,469 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:32,469 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-07 21:38:32,470 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:32,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:32,472 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:32,473 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:32,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:32,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:32,473 INFO 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-07 21:38:32,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:32,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:32,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:32,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:32,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:32,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:32,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:32,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:32,534 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:32,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:32,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:32,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:32,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:32,615 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-07 21:38:32,615 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:32,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:38:32,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:32,694 INFO L267 ElimStorePlain]: Start 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-07 21:38:32,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:32,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:38:32,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:32,785 INFO L267 ElimStorePlain]: Start 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-07 21:38:32,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:32,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,822 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:32,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:32,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:32,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:32,876 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-07 21:38:32,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:32,899 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-07 21:38:32,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:32,937 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-07 21:38:32,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:32,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:38:32,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:32,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:32,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:38:32,955 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-01-07 21:38:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:33,513 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-01-07 21:38:33,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:38:33,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:38:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:33,514 INFO L225 Difference]: With dead ends: 160 [2019-01-07 21:38:33,514 INFO L226 Difference]: Without dead ends: 159 [2019-01-07 21:38:33,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-07 21:38:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-01-07 21:38:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-07 21:38:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-01-07 21:38:33,663 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-01-07 21:38:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:33,663 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-01-07 21:38:33,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:33,663 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-01-07 21:38:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:33,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:33,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:33,664 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-01-07 21:38:33,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:33,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:33,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:33,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:33,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:33,866 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:38:33,921 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-07 21:38:33,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:33,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:33,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:33,922 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-07 21:38:33,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:33,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:33,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:33,924 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:38:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:33,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:33,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:33,925 INFO 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-07 21:38:33,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:33,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:33,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:33,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:33,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:33,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:33,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:33,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:33,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:33,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:34,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:34,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:34,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:34,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:34,059 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-07 21:38:34,059 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:34,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,097 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-07 21:38:34,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:34,136 INFO L267 ElimStorePlain]: Start 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-07 21:38:34,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:34,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:38:34,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:34,222 INFO L267 ElimStorePlain]: Start 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-07 21:38:34,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:34,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,268 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:34,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 104 [2019-01-07 21:38:34,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:34,320 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-07 21:38:34,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:34,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,356 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:34,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:34,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:34,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:34,410 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-07 21:38:34,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:34,431 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-07 21:38:34,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:34,483 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-07 21:38:34,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:34,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:38:34,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:34,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:38:34,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:38:34,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:34,504 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-01-07 21:38:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:35,361 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-01-07 21:38:35,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:35,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-07 21:38:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:35,363 INFO L225 Difference]: With dead ends: 197 [2019-01-07 21:38:35,364 INFO L226 Difference]: Without dead ends: 196 [2019-01-07 21:38:35,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:38:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-07 21:38:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-01-07 21:38:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-07 21:38:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-01-07 21:38:35,484 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-01-07 21:38:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:35,484 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-01-07 21:38:35,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:38:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-01-07 21:38:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:35,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:35,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:35,486 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:35,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-01-07 21:38:35,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:35,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:35,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:35,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:35,659 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-07 21:38:35,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:35,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:35,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:35,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:35,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:35,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:35,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:35,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:35,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:38:35,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:35,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:35,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:35,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:35,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:35,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:35,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:35,712 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:35,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:35,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:35,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:35,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:35,795 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-07 21:38:35,796 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:35,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,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, 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-07 21:38:35,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:35,877 INFO L267 ElimStorePlain]: Start 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-07 21:38:35,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:35,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,911 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-07 21:38:35,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:35,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:35,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:35,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:35,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-07 21:38:35,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:36,044 INFO L267 ElimStorePlain]: Start 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-07 21:38:36,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:38:36,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:36,086 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:36,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:38:36,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:36,136 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-07 21:38:36,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:38:36,158 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-07 21:38:36,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:36,215 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-07 21:38:36,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:36,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:38:36,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:36,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:36,234 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-01-07 21:38:37,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:37,169 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-01-07 21:38:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:37,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:38:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:37,172 INFO L225 Difference]: With dead ends: 195 [2019-01-07 21:38:37,172 INFO L226 Difference]: Without dead ends: 189 [2019-01-07 21:38:37,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-07 21:38:37,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-01-07 21:38:37,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-07 21:38:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-01-07 21:38:37,328 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-01-07 21:38:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:37,328 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-01-07 21:38:37,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-01-07 21:38:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:37,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:37,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:37,329 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-01-07 21:38:37,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:37,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:37,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:37,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:37,511 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-07 21:38:37,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:37,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:37,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:37,512 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-07 21:38:37,514 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:37,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:37,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:37,516 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:37,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:37,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:37,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:37,517 INFO 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-07 21:38:37,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:37,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:37,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:37,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:37,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:37,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:37,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:37,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:37,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:37,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:37,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:37,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:37,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:37,648 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-07 21:38:37,648 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:37,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 21:38:37,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:37,716 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-07 21:38:37,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:37,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,744 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:37,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 21:38:37,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:37,776 INFO L267 ElimStorePlain]: Start 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-07 21:38:37,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-07 21:38:37,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:37,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:38:37,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:37,837 INFO L267 ElimStorePlain]: Start 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-07 21:38:37,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:38:37,870 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-07 21:38:37,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:37,915 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-07 21:38:37,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:37,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:38:37,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:37,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:37,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:37,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:38:37,935 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-01-07 21:38:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:38,454 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-01-07 21:38:38,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:38:38,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:38:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:38,456 INFO L225 Difference]: With dead ends: 157 [2019-01-07 21:38:38,456 INFO L226 Difference]: Without dead ends: 156 [2019-01-07 21:38:38,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:38,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-07 21:38:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-01-07 21:38:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-07 21:38:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-01-07 21:38:38,588 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-01-07 21:38:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:38,588 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-01-07 21:38:38,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-01-07 21:38:38,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:38,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:38,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:38,589 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-01-07 21:38:38,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:38,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:38,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:38,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:38,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:38,752 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-07 21:38:38,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:38,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:38,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:38,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:38,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:38,753 INFO 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-07 21:38:38,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:38,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:38,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:38:38,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:38,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:38,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:38,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:38,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:38,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:38,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:38,824 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:38,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:38,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:38,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:38,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:38,889 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-07 21:38:38,889 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:38,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:38,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:38:38,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:38,959 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-07 21:38:38,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:39,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,018 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:39,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:38:39,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:39,045 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-07 21:38:39,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-07 21:38:39,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:38:39,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:39,107 INFO L267 ElimStorePlain]: Start 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-07 21:38:39,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-07 21:38:39,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:39,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:39,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, 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-07 21:38:39,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:39,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:39,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:38:39,193 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-07 21:38:39,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:39,250 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-07 21:38:39,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:39,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:38:39,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:39,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:39,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:39,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:39,269 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-01-07 21:38:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:39,926 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-01-07 21:38:39,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:39,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:38:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:39,929 INFO L225 Difference]: With dead ends: 178 [2019-01-07 21:38:39,929 INFO L226 Difference]: Without dead ends: 177 [2019-01-07 21:38:39,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-07 21:38:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-01-07 21:38:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-07 21:38:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-01-07 21:38:40,041 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-01-07 21:38:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:40,041 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-01-07 21:38:40,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-01-07 21:38:40,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:40,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:40,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:40,042 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:40,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:40,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-01-07 21:38:40,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:40,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:40,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:40,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:40,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:40,220 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-07 21:38:40,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:40,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:40,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:40,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:40,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:40,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:40,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:40,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:40,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:38:40,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:40,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:40,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 18 treesize of output 21 [2019-01-07 21:38:40,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:40,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:40,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:40,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:40,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:40,303 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:40,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:40,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:40,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:40,356 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-07 21:38:40,356 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:40,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,395 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-07 21:38:40,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:40,436 INFO L267 ElimStorePlain]: Start 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-07 21:38:40,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:40,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,472 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:40,473 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-07 21:38:40,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:40,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:40,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:40,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,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, 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-07 21:38:40,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:40,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-07 21:38:40,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:38:40,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:40,674 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:40,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-07 21:38:40,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:40,729 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-07 21:38:40,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:38:40,753 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-07 21:38:40,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:40,806 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-07 21:38:40,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:40,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:38:40,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:40,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:40,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:40,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:40,825 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-01-07 21:38:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:41,765 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-01-07 21:38:41,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:38:41,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:38:41,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:41,768 INFO L225 Difference]: With dead ends: 204 [2019-01-07 21:38:41,768 INFO L226 Difference]: Without dead ends: 203 [2019-01-07 21:38:41,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:38:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-07 21:38:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-01-07 21:38:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-07 21:38:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-01-07 21:38:41,887 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-01-07 21:38:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:41,888 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-01-07 21:38:41,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-01-07 21:38:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:41,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:41,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:41,889 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-01-07 21:38:41,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:41,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:41,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:41,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:41,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:42,061 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-07 21:38:42,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:42,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:42,062 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:42,062 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-07 21:38:42,063 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:42,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:42,065 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:42,065 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:42,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:42,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:42,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:42,066 INFO 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-07 21:38:42,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:42,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:42,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:42,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:42,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:42,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:42,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,206 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-07 21:38:42,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:42,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:42,216 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:42,237 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:42,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:42,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:42,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:42,291 INFO L267 ElimStorePlain]: Start 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-07 21:38:42,292 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:42,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 21:38:42,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:42,361 INFO L267 ElimStorePlain]: Start 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-07 21:38:42,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:42,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,385 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:42,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:38:42,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:42,417 INFO L267 ElimStorePlain]: Start 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-07 21:38:42,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:38:42,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:42,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-07 21:38:42,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:42,546 INFO L267 ElimStorePlain]: Start 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-07 21:38:42,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:38:42,567 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-07 21:38:42,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:42,596 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-07 21:38:42,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:42,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:38:42,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:42,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:42,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:42,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:42,616 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-01-07 21:38:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:43,186 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-01-07 21:38:43,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:43,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:38:43,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:43,189 INFO L225 Difference]: With dead ends: 178 [2019-01-07 21:38:43,189 INFO L226 Difference]: Without dead ends: 177 [2019-01-07 21:38:43,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:43,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-07 21:38:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-01-07 21:38:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-07 21:38:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-01-07 21:38:43,301 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-01-07 21:38:43,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:43,301 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-01-07 21:38:43,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-01-07 21:38:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:43,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:43,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:43,302 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:43,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-01-07 21:38:43,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:43,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:43,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:43,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:43,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:43,377 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-07 21:38:43,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:43,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:43,377 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:43,377 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-01-07 21:38:43,378 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:43,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:43,380 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:43,381 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:38:43,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:43,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:43,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:43,381 INFO 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-07 21:38:43,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:43,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:43,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:43,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:43,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:43,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:38:43,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:38:43,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:38:43,436 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:43,450 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:43,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:43,470 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:43,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:43,495 INFO L267 ElimStorePlain]: Start 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-07 21:38:43,495 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-07 21:38:43,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-07 21:38:43,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:43,541 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-07 21:38:43,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:38:43,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:43,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:38:43,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:43,583 INFO L267 ElimStorePlain]: Start 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-07 21:38:43,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:38:43,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-07 21:38:43,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:43,616 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-07 21:38:43,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:43,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:38:43,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:43,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:38:43,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:38:43,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:38:43,636 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-01-07 21:38:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:44,002 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-01-07 21:38:44,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:38:44,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-07 21:38:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:44,004 INFO L225 Difference]: With dead ends: 134 [2019-01-07 21:38:44,004 INFO L226 Difference]: Without dead ends: 133 [2019-01-07 21:38:44,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:38:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-07 21:38:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-01-07 21:38:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-07 21:38:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-07 21:38:44,120 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-07 21:38:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:44,120 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-07 21:38:44,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:38:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-07 21:38:44,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:44,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:44,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:44,121 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:44,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:44,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-01-07 21:38:44,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:44,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:44,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:44,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:44,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:44,274 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-07 21:38:44,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:44,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:44,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:44,275 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-01-07 21:38:44,275 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:44,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:44,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:44,278 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:44,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:44,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:44,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:44,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:44,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:44,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:44,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:44,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:44,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:44,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:44,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:44,647 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-07 21:38:44,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:44,648 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:45,052 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:45,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:45,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:45,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:45,139 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-07 21:38:45,139 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:45,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:38:45,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:45,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:45,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,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, 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-07 21:38:45,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:45,302 INFO L267 ElimStorePlain]: Start 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-07 21:38:45,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:45,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:45,339 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:45,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:45,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:45,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-07 21:38:45,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:45,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-07 21:38:45,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:45,448 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-07 21:38:45,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:45,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:38:45,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:45,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:45,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:45,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:38:45,467 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-07 21:38:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:46,064 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-01-07 21:38:46,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:38:46,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:38:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:46,066 INFO L225 Difference]: With dead ends: 143 [2019-01-07 21:38:46,066 INFO L226 Difference]: Without dead ends: 142 [2019-01-07 21:38:46,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:38:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-07 21:38:46,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-01-07 21:38:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-07 21:38:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-07 21:38:46,183 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-07 21:38:46,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:46,183 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-07 21:38:46,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-07 21:38:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:46,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:46,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:46,184 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-01-07 21:38:46,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:46,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:46,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:46,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:46,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:46,277 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-07 21:38:46,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:46,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:46,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:46,278 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-01-07 21:38:46,279 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:46,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:46,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:46,282 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:46,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:46,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:46,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:46,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:46,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:46,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:46,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:46,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:46,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:38:46,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:38:46,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:38:46,344 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:46,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:46,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:46,379 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:46,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:46,402 INFO L267 ElimStorePlain]: Start 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-07 21:38:46,403 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-07 21:38:46,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-07 21:38:46,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:46,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:46,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:38:46,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:38:46,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:46,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:46,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:38:46,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:46,513 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:46,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-07 21:38:46,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:46,535 INFO L267 ElimStorePlain]: Start 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-07 21:38:46,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:38:46,548 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-07 21:38:46,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:46,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:46,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:38:46,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:46,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:46,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:46,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:46,591 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-07 21:38:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:47,110 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-01-07 21:38:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:38:47,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:38:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:47,112 INFO L225 Difference]: With dead ends: 151 [2019-01-07 21:38:47,112 INFO L226 Difference]: Without dead ends: 150 [2019-01-07 21:38:47,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:38:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-07 21:38:47,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-01-07 21:38:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-07 21:38:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-01-07 21:38:47,244 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-01-07 21:38:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:47,245 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-01-07 21:38:47,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-01-07 21:38:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:47,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:47,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:47,245 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-01-07 21:38:47,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:47,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:47,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:47,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:47,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:47,461 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-07 21:38:47,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:47,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:47,462 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:47,462 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-07 21:38:47,462 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:47,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:47,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:47,466 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:38:47,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:47,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:47,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:47,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:47,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:47,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:47,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:47,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:47,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:47,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:47,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:47,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:47,510 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:47,660 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:47,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:47,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:47,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:47,712 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-07 21:38:47,712 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:47,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:38:47,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:47,787 INFO L267 ElimStorePlain]: Start 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-07 21:38:47,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:47,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,824 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:47,825 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-07 21:38:47,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:47,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:47,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:47,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,910 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:47,911 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-07 21:38:47,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:47,953 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-07 21:38:47,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:47,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:47,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, 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-07 21:38:47,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:48,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:48,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:48,064 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-07 21:38:48,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:48,106 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-07 21:38:48,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:48,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:38:48,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:48,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:38:48,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:38:48,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:48,126 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-01-07 21:38:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:48,995 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-01-07 21:38:48,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:38:48,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:38:48,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:48,998 INFO L225 Difference]: With dead ends: 215 [2019-01-07 21:38:48,998 INFO L226 Difference]: Without dead ends: 214 [2019-01-07 21:38:48,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-07 21:38:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-01-07 21:38:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-07 21:38:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-01-07 21:38:49,151 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-01-07 21:38:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:49,151 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-01-07 21:38:49,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:38:49,152 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-01-07 21:38:49,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:49,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:49,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:49,152 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:49,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:49,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-07 21:38:49,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:49,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:49,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:49,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:49,176 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-07 21:38:49,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:49,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:49,177 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:49,177 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-07 21:38:49,178 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:49,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:49,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:49,180 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:38:49,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:49,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:49,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:49,181 INFO 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-07 21:38:49,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:49,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:49,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:49,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:49,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:49,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:38:49,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-07 21:38:49,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-07 21:38:49,258 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:49,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:49,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:49,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:49,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:49,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-07 21:38:49,306 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-07 21:38:49,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:49,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-07 21:38:49,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:49,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:49,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-07 21:38:49,403 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-07 21:38:49,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:49,412 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-07 21:38:49,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 21:38:49,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-07 21:38:49,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:38:49,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:38:49,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:38:49,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:38:49,432 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-01-07 21:38:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:49,802 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-01-07 21:38:49,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:38:49,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-07 21:38:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:49,807 INFO L225 Difference]: With dead ends: 280 [2019-01-07 21:38:49,807 INFO L226 Difference]: Without dead ends: 275 [2019-01-07 21:38:49,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 21:38:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-07 21:38:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-01-07 21:38:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-07 21:38:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-01-07 21:38:50,102 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-01-07 21:38:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:50,102 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-01-07 21:38:50,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:38:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-01-07 21:38:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:50,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:50,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:50,103 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:50,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-01-07 21:38:50,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:50,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:50,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:50,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:50,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:50,248 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-07 21:38:50,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:50,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:50,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:50,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:50,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:50,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:50,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:50,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:50,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:38:50,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:50,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:50,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:50,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:50,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:50,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:50,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:50,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:50,333 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:50,348 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:50,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:50,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:50,388 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-07 21:38:50,389 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:50,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,426 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-07 21:38:50,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:50,468 INFO L267 ElimStorePlain]: Start 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-07 21:38:50,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:50,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:38:50,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:50,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:50,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:50,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,599 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:50,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:50,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:50,652 INFO L267 ElimStorePlain]: Start 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-07 21:38:50,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:50,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:50,693 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:50,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:38:50,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:50,743 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-07 21:38:50,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:50,768 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-07 21:38:50,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:50,821 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-07 21:38:50,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:50,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:38:50,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:50,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:38:50,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:38:50,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:50,840 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-01-07 21:38:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:51,887 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-01-07 21:38:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:38:51,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-07 21:38:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:51,890 INFO L225 Difference]: With dead ends: 329 [2019-01-07 21:38:51,890 INFO L226 Difference]: Without dead ends: 328 [2019-01-07 21:38:51,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:38:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-07 21:38:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-01-07 21:38:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-07 21:38:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-01-07 21:38:52,199 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-01-07 21:38:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:52,199 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-01-07 21:38:52,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:38:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-01-07 21:38:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:52,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:52,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:52,200 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-07 21:38:52,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:52,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:52,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:52,750 WARN L181 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-07 21:38:52,926 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-07 21:38:52,935 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-07 21:38:52,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:52,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:52,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:52,936 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-07 21:38:52,937 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:52,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:52,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:52,940 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:38:52,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:52,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:52,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:52,941 INFO 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-07 21:38:52,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:52,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:52,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:52,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:53,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:53,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:38:53,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:38:53,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:38:53,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:53,060 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:53,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:53,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:53,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:53,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:53,108 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:38:53,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:38:53,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:53,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:53,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:53,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 31 treesize of output 65 [2019-01-07 21:38:53,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:53,235 INFO L267 ElimStorePlain]: Start 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-07 21:38:53,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:38:53,255 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-07 21:38:53,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:53,278 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-07 21:38:53,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:53,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:38:53,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:53,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:38:53,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:38:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:38:53,298 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-01-07 21:38:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:53,890 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-01-07 21:38:53,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:38:53,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-07 21:38:53,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:53,894 INFO L225 Difference]: With dead ends: 290 [2019-01-07 21:38:53,894 INFO L226 Difference]: Without dead ends: 286 [2019-01-07 21:38:53,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:38:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-07 21:38:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-01-07 21:38:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-07 21:38:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-01-07 21:38:54,194 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-01-07 21:38:54,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:54,195 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-01-07 21:38:54,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:38:54,195 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-01-07 21:38:54,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:54,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:54,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:54,196 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:54,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-01-07 21:38:54,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:54,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:54,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:54,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:54,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:54,302 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-07 21:38:54,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:54,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:54,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:54,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:54,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:54,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:54,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:54,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:54,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:38:54,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:54,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:54,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:54,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:38:54,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:38:54,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:38:54,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:38:54,359 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:54,373 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:54,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:54,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:54,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:54,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:54,417 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-07 21:38:54,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-07 21:38:54,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:54,466 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-07 21:38:54,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:38:54,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,490 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:54,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-01-07 21:38:54,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:54,508 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-07 21:38:54,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:38:54,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:54,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-07 21:38:54,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:54,550 INFO L267 ElimStorePlain]: Start 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-07 21:38:54,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:38:54,567 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-07 21:38:54,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:54,601 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-07 21:38:54,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:54,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:38:54,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:54,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:38:54,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:38:54,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:38:54,620 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-01-07 21:38:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:55,264 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-01-07 21:38:55,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:38:55,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:38:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:55,267 INFO L225 Difference]: With dead ends: 307 [2019-01-07 21:38:55,267 INFO L226 Difference]: Without dead ends: 302 [2019-01-07 21:38:55,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:38:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-07 21:38:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-01-07 21:38:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-07 21:38:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-01-07 21:38:55,550 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-01-07 21:38:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:55,550 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-01-07 21:38:55,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:38:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-01-07 21:38:55,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:55,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:55,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:55,551 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:55,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-01-07 21:38:55,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:55,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:55,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:55,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:55,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:55,779 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-07 21:38:55,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:55,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:55,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:55,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:55,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:55,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:38:55,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:38:55,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:38:55,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:38:55,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:55,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:55,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:55,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:55,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:55,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:55,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:55,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:55,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:55,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:55,886 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:55,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:55,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:55,915 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:55,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:55,955 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-07 21:38:55,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:55,996 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-07 21:38:55,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:56,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,042 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:56,042 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-07 21:38:56,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:56,087 INFO L267 ElimStorePlain]: Start 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-07 21:38:56,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:56,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,134 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:56,134 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-07 21:38:56,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:56,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:56,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:56,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:56,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:56,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:38:56,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:56,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,302 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:56,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:56,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:56,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:56,351 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-07 21:38:56,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:38:56,384 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-07 21:38:56,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:56,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:56,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-07 21:38:56,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:56,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:38:56,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:38:56,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:38:56,509 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-01-07 21:38:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:57,869 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-01-07 21:38:57,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:38:57,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-07 21:38:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:57,873 INFO L225 Difference]: With dead ends: 284 [2019-01-07 21:38:57,873 INFO L226 Difference]: Without dead ends: 279 [2019-01-07 21:38:57,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-07 21:38:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-07 21:38:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-01-07 21:38:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-07 21:38:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-01-07 21:38:58,166 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-01-07 21:38:58,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:58,166 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-01-07 21:38:58,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:38:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-01-07 21:38:58,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:58,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:58,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:58,167 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:58,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-01-07 21:38:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:58,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:58,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:58,231 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-07 21:38:58,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:58,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:58,232 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:58,232 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-07 21:38:58,233 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:58,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:58,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:58,236 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:38:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:58,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:58,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:58,237 INFO 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-07 21:38:58,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:58,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:58,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:58,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:58,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:58,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:58,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:58,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:58,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:58,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:58,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:58,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:58,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:58,396 INFO L267 ElimStorePlain]: Start 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-07 21:38:58,397 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:58,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,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 72 [2019-01-07 21:38:58,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:58,471 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-07 21:38:58,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:58,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:58,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-07 21:38:58,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:58,550 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-07 21:38:58,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:58,569 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-07 21:38:58,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:58,580 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-07 21:38:58,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:58,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-07 21:38:58,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:58,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:38:58,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:38:58,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:38:58,601 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-01-07 21:38:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:59,180 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-01-07 21:38:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:38:59,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-07 21:38:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:59,182 INFO L225 Difference]: With dead ends: 230 [2019-01-07 21:38:59,183 INFO L226 Difference]: Without dead ends: 223 [2019-01-07 21:38:59,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:38:59,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-07 21:38:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-01-07 21:38:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-07 21:38:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-01-07 21:38:59,471 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-01-07 21:38:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:59,471 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-01-07 21:38:59,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:38:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-01-07 21:38:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:38:59,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:59,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:38:59,472 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:38:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-01-07 21:38:59,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:59,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:59,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:59,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:59,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:59,559 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-07 21:38:59,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:59,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:59,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:38:59,560 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-01-07 21:38:59,561 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:38:59,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:38:59,568 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:38:59,568 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:38:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:59,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:38:59,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:59,568 INFO 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-07 21:38:59,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:59,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:59,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:59,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:38:59,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:38:59,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:38:59,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:38:59,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:38:59,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:59,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:59,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:59,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:59,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:59,711 INFO L267 ElimStorePlain]: Start 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-07 21:38:59,712 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:38:59,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,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, 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-07 21:38:59,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:59,788 INFO L267 ElimStorePlain]: Start 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-07 21:38:59,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:59,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:59,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:59,873 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-07 21:38:59,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:38:59,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:38:59,913 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:38:59,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:38:59,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:59,967 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-07 21:38:59,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:38:59,986 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-07 21:38:59,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:00,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:00,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-07 21:39:00,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:00,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:39:00,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:39:00,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:39:00,028 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-01-07 21:39:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:00,755 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-01-07 21:39:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:39:00,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-07 21:39:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:00,758 INFO L225 Difference]: With dead ends: 254 [2019-01-07 21:39:00,758 INFO L226 Difference]: Without dead ends: 253 [2019-01-07 21:39:00,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:39:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-07 21:39:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-01-07 21:39:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-07 21:39:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-01-07 21:39:01,099 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-01-07 21:39:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:01,100 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-01-07 21:39:01,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:39:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-01-07 21:39:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:39:01,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:01,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:01,101 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-01-07 21:39:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:01,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:01,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:01,173 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-07 21:39:01,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:01,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:01,173 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:39:01,173 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-07 21:39:01,174 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:01,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:01,176 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:01,176 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:39:01,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:01,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:01,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:01,177 INFO 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-07 21:39:01,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:01,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:01,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:01,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:01,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:01,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:01,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:01,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:01,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:01,258 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:01,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:01,284 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:01,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:01,313 INFO L267 ElimStorePlain]: Start 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-07 21:39:01,313 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:01,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,342 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-07 21:39:01,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:01,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:01,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:01,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:01,419 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:01,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, 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-07 21:39:01,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:01,464 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-07 21:39:01,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:01,483 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-07 21:39:01,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:01,501 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-07 21:39:01,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:01,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:39:01,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:01,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:39:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:39:01,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:39:01,521 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-01-07 21:39:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:02,017 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-01-07 21:39:02,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:39:02,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-07 21:39:02,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:02,020 INFO L225 Difference]: With dead ends: 223 [2019-01-07 21:39:02,020 INFO L226 Difference]: Without dead ends: 216 [2019-01-07 21:39:02,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:39:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-07 21:39:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-01-07 21:39:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-07 21:39:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-01-07 21:39:02,352 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-01-07 21:39:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:02,352 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-01-07 21:39:02,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:39:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-01-07 21:39:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:39:02,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:02,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:02,353 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-01-07 21:39:02,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:02,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:02,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:02,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:02,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:02,519 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-07 21:39:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:39:02,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:02,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:02,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:02,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:02,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:02,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:39:02,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:39:02,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:39:02,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:39:02,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:02,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:02,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:02,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:02,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:02,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:02,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:02,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:02,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:02,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:02,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:02,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:02,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:02,760 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:02,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:39:02,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:02,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-07 21:39:02,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:02,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:02,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:02,929 INFO L267 ElimStorePlain]: Start 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-07 21:39:02,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:02,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:02,972 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:02,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:02,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:03,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:03,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:03,066 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:03,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 98 [2019-01-07 21:39:03,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:03,114 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-07 21:39:03,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:03,143 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-07 21:39:03,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:03,207 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-07 21:39:03,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:03,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:39:03,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:03,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:39:03,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:39:03,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:39:03,227 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-01-07 21:39:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:04,340 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-01-07 21:39:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:39:04,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-07 21:39:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:04,344 INFO L225 Difference]: With dead ends: 285 [2019-01-07 21:39:04,345 INFO L226 Difference]: Without dead ends: 279 [2019-01-07 21:39:04,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:39:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-07 21:39:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-01-07 21:39:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-07 21:39:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-01-07 21:39:04,661 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-01-07 21:39:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:04,661 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-01-07 21:39:04,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:39:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-01-07 21:39:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:39:04,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:04,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:04,662 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:04,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-01-07 21:39:04,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:04,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:04,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:04,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:04,762 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-07 21:39:04,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:04,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:04,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:04,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:04,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:04,763 INFO 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-07 21:39:04,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:39:04,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:39:04,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:39:04,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:04,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:04,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:04,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:04,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:04,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:04,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:04,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:04,854 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:04,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:04,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:04,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:04,908 INFO L267 ElimStorePlain]: Start 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-07 21:39:04,909 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:04,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:04,945 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-07 21:39:04,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:04,988 INFO L267 ElimStorePlain]: Start 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-07 21:39:04,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:05,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,027 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:05,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:39:05,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:05,070 INFO L267 ElimStorePlain]: Start 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-07 21:39:05,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:05,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:05,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:05,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:05,154 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-07 21:39:05,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:05,174 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-07 21:39:05,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:05,206 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-07 21:39:05,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:05,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:39:05,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:05,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:39:05,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:39:05,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:39:05,226 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-01-07 21:39:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:06,037 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-01-07 21:39:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:39:06,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:39:06,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:06,041 INFO L225 Difference]: With dead ends: 252 [2019-01-07 21:39:06,041 INFO L226 Difference]: Without dead ends: 247 [2019-01-07 21:39:06,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:39:06,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-07 21:39:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-01-07 21:39:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-07 21:39:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-01-07 21:39:06,328 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-01-07 21:39:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:06,328 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-01-07 21:39:06,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:39:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-01-07 21:39:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:39:06,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:06,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:06,329 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-07 21:39:06,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:06,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:06,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:06,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:06,398 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-07 21:39:06,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:06,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:06,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:39:06,399 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-07 21:39:06,400 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:06,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:06,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:06,401 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:39:06,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:06,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:06,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:06,402 INFO 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-07 21:39:06,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:06,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:06,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:06,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:06,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:06,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:06,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:06,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:06,452 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:06,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:06,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:06,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:06,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:06,536 INFO L267 ElimStorePlain]: Start 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-07 21:39:06,536 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:06,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,571 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-07 21:39:06,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:06,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:06,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:06,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:06,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-07 21:39:06,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:06,697 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-07 21:39:06,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:06,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-07 21:39:06,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:06,738 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-07 21:39:06,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:06,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:39:06,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:06,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:39:06,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:39:06,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:39:06,757 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-01-07 21:39:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:07,284 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-01-07 21:39:07,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:39:07,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-07 21:39:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:07,287 INFO L225 Difference]: With dead ends: 194 [2019-01-07 21:39:07,287 INFO L226 Difference]: Without dead ends: 193 [2019-01-07 21:39:07,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:39:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-07 21:39:07,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-01-07 21:39:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-07 21:39:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-01-07 21:39:07,594 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-01-07 21:39:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:07,594 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-01-07 21:39:07,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:39:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-01-07 21:39:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:39:07,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:07,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:07,595 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-01-07 21:39:07,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:07,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:07,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:07,999 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-07 21:39:08,083 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-07 21:39:08,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:08,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:08,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:08,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:08,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:08,084 INFO 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-07 21:39:08,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:39:08,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:39:08,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:39:08,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:08,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:08,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:08,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:39:08,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:39:08,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:39:08,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:39:08,139 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:08,159 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:08,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:08,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:08,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:08,207 INFO L267 ElimStorePlain]: Start 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-07 21:39:08,208 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:39:08,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,420 INFO L303 Elim1Store]: Index analysis took 177 ms [2019-01-07 21:39:08,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:39:08,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:08,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:08,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:39:08,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-07 21:39:08,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:08,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:08,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:39:08,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,549 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:08,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:08,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-07 21:39:08,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:08,585 INFO L267 ElimStorePlain]: Start 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-07 21:39:08,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:39:08,608 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-07 21:39:08,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:08,642 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-07 21:39:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:08,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:39:08,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:08,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:39:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:39:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:39:08,663 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-01-07 21:39:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:09,537 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-01-07 21:39:09,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:39:09,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-07 21:39:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:09,540 INFO L225 Difference]: With dead ends: 265 [2019-01-07 21:39:09,541 INFO L226 Difference]: Without dead ends: 264 [2019-01-07 21:39:09,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:39:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-07 21:39:09,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-01-07 21:39:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-07 21:39:09,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-01-07 21:39:09,882 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-01-07 21:39:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:09,883 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-01-07 21:39:09,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:39:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-01-07 21:39:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:39:09,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:09,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:09,883 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-01-07 21:39:09,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:09,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:09,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:09,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:09,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:10,021 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-07 21:39:10,032 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-07 21:39:10,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:10,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:10,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:39:10,032 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-07 21:39:10,033 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:10,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:10,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:10,035 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:39:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:10,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:10,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:10,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 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-07 21:39:10,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:10,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:10,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:10,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:10,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:39:10,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:39:10,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:39:10,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:39:10,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:10,101 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:10,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:10,121 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:10,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:10,145 INFO L267 ElimStorePlain]: Start 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-07 21:39:10,145 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-07 21:39:10,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-07 21:39:10,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:10,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:10,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:39:10,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:10,213 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:10,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2019-01-07 21:39:10,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:10,232 INFO L267 ElimStorePlain]: Start 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-07 21:39:10,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-07 21:39:10,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-07 21:39:10,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:10,265 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-07 21:39:10,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:10,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:39:10,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:10,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:39:10,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:39:10,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:39:10,285 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-01-07 21:39:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:10,812 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-01-07 21:39:10,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:39:10,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-07 21:39:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:10,814 INFO L225 Difference]: With dead ends: 210 [2019-01-07 21:39:10,814 INFO L226 Difference]: Without dead ends: 203 [2019-01-07 21:39:10,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:39:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-07 21:39:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-01-07 21:39:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-07 21:39:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-01-07 21:39:11,156 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-01-07 21:39:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:11,156 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-01-07 21:39:11,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:39:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-01-07 21:39:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:39:11,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:11,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:11,157 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:11,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-01-07 21:39:11,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:11,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:11,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:11,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:11,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:11,241 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-07 21:39:11,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:11,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:11,242 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 21:39:11,242 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-01-07 21:39:11,242 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:11,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:11,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:11,245 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:39:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:11,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:11,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:11,246 INFO 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-07 21:39:11,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:11,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:11,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:11,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:11,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:39:11,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:39:11,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:39:11,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:39:11,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:11,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:11,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:11,344 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:11,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:11,369 INFO L267 ElimStorePlain]: Start 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-07 21:39:11,369 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:39:11,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:39:11,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:11,438 INFO L267 ElimStorePlain]: Start 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-07 21:39:11,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:39:11,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:11,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-07 21:39:11,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:11,495 INFO L267 ElimStorePlain]: Start 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-07 21:39:11,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:39:11,516 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-07 21:39:11,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:11,833 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-07 21:39:11,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:11,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:39:11,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:11,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:39:11,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:39:11,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:39:11,852 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-01-07 21:39:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:12,451 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-01-07 21:39:12,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:39:12,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-07 21:39:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:12,453 INFO L225 Difference]: With dead ends: 216 [2019-01-07 21:39:12,453 INFO L226 Difference]: Without dead ends: 212 [2019-01-07 21:39:12,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:39:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-07 21:39:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-01-07 21:39:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-07 21:39:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-01-07 21:39:12,817 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-01-07 21:39:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:12,817 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-01-07 21:39:12,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:39:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-01-07 21:39:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:12,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:12,818 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:12,818 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:12,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-01-07 21:39:12,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:12,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:12,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:12,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:12,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:12,946 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-07 21:39:12,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:12,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:12,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:12,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:12,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:12,947 INFO 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-07 21:39:12,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:39:12,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:39:12,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:39:12,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:12,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:12,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:12,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:12,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:12,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:12,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:12,994 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:13,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:13,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:13,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:13,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:13,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:13,084 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:13,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:39:13,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:13,152 INFO L267 ElimStorePlain]: Start 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-07 21:39:13,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:13,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,344 INFO L303 Elim1Store]: Index analysis took 173 ms [2019-01-07 21:39:13,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-07 21:39:13,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:13,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:13,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-07 21:39:13,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:13,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:13,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:13,469 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-07 21:39:13,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:13,490 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-07 21:39:13,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:13,511 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-07 21:39:13,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:13,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:39:13,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:13,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:39:13,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:39:13,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:39:13,531 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-01-07 21:39:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:14,641 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-01-07 21:39:14,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:39:14,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-07 21:39:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:14,644 INFO L225 Difference]: With dead ends: 401 [2019-01-07 21:39:14,644 INFO L226 Difference]: Without dead ends: 397 [2019-01-07 21:39:14,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 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-07 21:39:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-07 21:39:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-01-07 21:39:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-07 21:39:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-01-07 21:39:15,299 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-01-07 21:39:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:15,299 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-01-07 21:39:15,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:39:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-01-07 21:39:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:15,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:15,300 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:15,300 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-01-07 21:39:15,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:15,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:15,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:39:15,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:39:15,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 21:39:15,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:39:15,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:39:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:39:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:39:15,353 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-01-07 21:39:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:16,027 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-01-07 21:39:16,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:39:16,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-07 21:39:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:16,029 INFO L225 Difference]: With dead ends: 347 [2019-01-07 21:39:16,029 INFO L226 Difference]: Without dead ends: 342 [2019-01-07 21:39:16,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:39:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-07 21:39:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-01-07 21:39:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-07 21:39:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-01-07 21:39:16,695 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-01-07 21:39:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:16,695 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-01-07 21:39:16,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:39:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-01-07 21:39:16,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:16,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:16,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:16,697 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:16,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:16,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-01-07 21:39:16,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:16,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:16,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:16,891 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-07 21:39:16,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:16,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:16,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:16,892 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-07 21:39:16,893 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:16,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:16,895 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:16,895 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-07 21:39:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:16,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:16,895 INFO 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-07 21:39:16,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:16,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:16,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:16,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:16,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:16,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:16,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:16,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:16,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:16,943 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,062 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,119 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:17,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,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, 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-07 21:39:17,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,200 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-07 21:39:17,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:17,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-07 21:39:17,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,283 INFO L267 ElimStorePlain]: Start 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-07 21:39:17,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:17,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,323 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:17,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:17,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,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-07 21:39:17,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:17,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:17,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:17,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,475 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-07 21:39:17,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:17,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,514 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:17,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:17,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:17,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:17,566 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-07 21:39:17,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:39:17,588 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-07 21:39:17,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:17,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:17,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:17,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-07 21:39:17,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:17,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:39:17,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:39:17,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:39:17,673 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-01-07 21:39:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:19,507 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-01-07 21:39:19,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:39:19,508 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-07 21:39:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:19,510 INFO L225 Difference]: With dead ends: 471 [2019-01-07 21:39:19,510 INFO L226 Difference]: Without dead ends: 470 [2019-01-07 21:39:19,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-01-07 21:39:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-01-07 21:39:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-01-07 21:39:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-01-07 21:39:20,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-01-07 21:39:20,231 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-01-07 21:39:20,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:20,231 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-01-07 21:39:20,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:39:20,231 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-01-07 21:39:20,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:20,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:20,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:20,232 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:20,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-01-07 21:39:20,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:20,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:20,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:20,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:20,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:20,436 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-07 21:39:20,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:20,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:20,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:20,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:20,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:20,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:39:20,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:39:20,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:39:20,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:39:20,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:20,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:20,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:20,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:20,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:20,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:20,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:20,480 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,564 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:20,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,604 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-07 21:39:20,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,648 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-07 21:39:20,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:20,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:20,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,735 INFO L267 ElimStorePlain]: Start 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-07 21:39:20,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:20,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,781 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:20,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,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, 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-07 21:39:20,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:20,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-07 21:39:20,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,879 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:20,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:39:20,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:20,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:20,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:39:20,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:20,971 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:20,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:39:20,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:21,019 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-07 21:39:21,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:39:21,045 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-07 21:39:21,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:21,121 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-07 21:39:21,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:21,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-07 21:39:21,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:21,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:39:21,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:39:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:39:21,140 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-01-07 21:39:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:22,995 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-01-07 21:39:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:39:22,995 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-07 21:39:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:22,997 INFO L225 Difference]: With dead ends: 483 [2019-01-07 21:39:22,997 INFO L226 Difference]: Without dead ends: 482 [2019-01-07 21:39:22,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:39:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-01-07 21:39:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-01-07 21:39:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-07 21:39:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-01-07 21:39:23,707 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-01-07 21:39:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:23,707 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-01-07 21:39:23,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:39:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-01-07 21:39:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:23,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:23,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:23,708 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-01-07 21:39:23,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:23,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:23,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:23,980 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-07 21:39:24,038 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-07 21:39:24,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:24,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:24,038 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:24,039 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-07 21:39:24,039 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:24,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:24,041 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:24,041 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:39:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:24,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:24,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:24,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:39:24,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:24,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:24,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:24,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:24,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:39:24,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:39:24,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:39:24,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:39:24,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:24,100 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:24,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:24,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:24,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:24,143 INFO L267 ElimStorePlain]: Start 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-07 21:39:24,143 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-07 21:39:24,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-07 21:39:24,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:24,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:24,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-01-07 21:39:24,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 21:39:24,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:24,229 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-07 21:39:24,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-07 21:39:24,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:24,254 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:24,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-07 21:39:24,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:24,276 INFO L267 ElimStorePlain]: Start 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-07 21:39:24,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:39:24,293 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-07 21:39:24,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:24,327 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-07 21:39:24,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:24,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:39:24,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:24,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:39:24,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:39:24,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:39:24,347 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-01-07 21:39:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:25,395 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-01-07 21:39:25,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:39:25,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-07 21:39:25,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:25,397 INFO L225 Difference]: With dead ends: 400 [2019-01-07 21:39:25,397 INFO L226 Difference]: Without dead ends: 393 [2019-01-07 21:39:25,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:39:25,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-07 21:39:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-01-07 21:39:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-07 21:39:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-01-07 21:39:26,143 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-01-07 21:39:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:26,143 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-01-07 21:39:26,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:39:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-01-07 21:39:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:26,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:26,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:26,145 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:26,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-01-07 21:39:26,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:26,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:26,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:26,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:26,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:26,272 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-07 21:39:26,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:26,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:26,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:26,272 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-07 21:39:26,273 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:26,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:26,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:26,276 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:39:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:26,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:26,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:26,277 INFO 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-07 21:39:26,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:26,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:26,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:26,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:26,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:26,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:26,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:26,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:26,329 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:26,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:26,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:26,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:26,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:26,412 INFO L267 ElimStorePlain]: Start 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-07 21:39:26,412 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:26,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,447 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-07 21:39:26,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:26,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:26,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:26,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,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 88 [2019-01-07 21:39:26,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:26,575 INFO L267 ElimStorePlain]: Start 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-07 21:39:26,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:26,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:26,615 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:26,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:26,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:26,668 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-07 21:39:26,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:26,690 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-07 21:39:26,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:26,725 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-07 21:39:26,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:26,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:39:26,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:26,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:39:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:39:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:39:26,743 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-01-07 21:39:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:27,898 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-01-07 21:39:27,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:39:27,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-07 21:39:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:27,900 INFO L225 Difference]: With dead ends: 409 [2019-01-07 21:39:27,900 INFO L226 Difference]: Without dead ends: 397 [2019-01-07 21:39:27,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:39:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-07 21:39:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-01-07 21:39:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-07 21:39:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-01-07 21:39:28,614 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-01-07 21:39:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:28,614 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-01-07 21:39:28,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:39:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-01-07 21:39:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:28,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:28,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:28,615 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:28,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:28,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-01-07 21:39:28,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:28,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:28,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:28,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:28,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:28,776 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-07 21:39:28,926 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-07 21:39:28,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:28,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:28,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:28,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:28,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:28,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:39:28,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:39:28,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:39:28,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:39:28,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:28,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:28,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:28,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:28,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:28,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:28,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:28,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:28,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:28,996 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,051 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:29,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,103 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-07 21:39:29,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,145 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-07 21:39:29,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:29,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:39:29,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,232 INFO L267 ElimStorePlain]: Start 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-07 21:39:29,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:29,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,274 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:29,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,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, 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-07 21:39:29,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:29,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-07 21:39:29,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,371 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:29,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:39:29,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:29,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:39:29,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:29,467 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:29,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:39:29,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:29,518 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-07 21:39:29,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:39:29,548 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-07 21:39:29,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:29,632 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-07 21:39:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:29,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-07 21:39:29,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:29,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:39:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:39:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:39:29,652 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-01-07 21:39:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:31,715 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-01-07 21:39:31,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:39:31,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-07 21:39:31,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:31,718 INFO L225 Difference]: With dead ends: 542 [2019-01-07 21:39:31,718 INFO L226 Difference]: Without dead ends: 536 [2019-01-07 21:39:31,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-01-07 21:39:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-07 21:39:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-01-07 21:39:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-07 21:39:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-01-07 21:39:32,668 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-01-07 21:39:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:32,668 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-01-07 21:39:32,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:39:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-01-07 21:39:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:32,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:32,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:32,669 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:32,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:32,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-01-07 21:39:32,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:32,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:32,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:32,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:32,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:32,843 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-07 21:39:32,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:32,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:32,844 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:32,844 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-07 21:39:32,845 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:32,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:32,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:32,847 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:39:32,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:32,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:32,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:32,848 INFO 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-07 21:39:32,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:32,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:32,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:32,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:32,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:32,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:32,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:32,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:32,885 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:32,913 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:32,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:32,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:32,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:32,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:32,967 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:32,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:32,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,003 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-07 21:39:33,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:33,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:33,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:33,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:33,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:33,154 INFO L267 ElimStorePlain]: Start 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-07 21:39:33,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:33,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:33,243 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:33,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:33,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:33,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-07 21:39:33,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:33,343 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-07 21:39:33,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:33,383 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-07 21:39:33,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:33,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:39:33,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:33,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:39:33,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:39:33,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:39:33,403 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-01-07 21:39:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:34,796 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-01-07 21:39:34,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:39:34,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-07 21:39:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:34,799 INFO L225 Difference]: With dead ends: 469 [2019-01-07 21:39:34,799 INFO L226 Difference]: Without dead ends: 465 [2019-01-07 21:39:34,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:39:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-01-07 21:39:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-01-07 21:39:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-07 21:39:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-01-07 21:39:35,828 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-01-07 21:39:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:35,828 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-01-07 21:39:35,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:39:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-01-07 21:39:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:35,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:35,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:35,830 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:35,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:35,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-01-07 21:39:35,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:35,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:35,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:36,098 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-07 21:39:36,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:36,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:36,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:36,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:36,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:36,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 21:39:36,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:36,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:36,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:36,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:36,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:36,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:36,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:36,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:36,138 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,165 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,219 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:36,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-07 21:39:36,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,297 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-07 21:39:36,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:36,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,335 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:36,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 38 treesize of output 81 [2019-01-07 21:39:36,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,379 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-07 21:39:36,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-01-07 21:39:36,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-07 21:39:36,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,465 INFO L267 ElimStorePlain]: Start 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-07 21:39:36,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-07 21:39:36,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,510 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:36,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:39:36,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,561 INFO L267 ElimStorePlain]: Start 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-07 21:39:36,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:39:36,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:36,605 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:36,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:39:36,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:36,653 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-07 21:39:36,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:39:36,679 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-07 21:39:36,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:36,779 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-07 21:39:36,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:36,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-07 21:39:36,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:36,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:39:36,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:39:36,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:39:36,798 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-01-07 21:39:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:38,663 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-01-07 21:39:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:39:38,663 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-07 21:39:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:38,665 INFO L225 Difference]: With dead ends: 481 [2019-01-07 21:39:38,665 INFO L226 Difference]: Without dead ends: 480 [2019-01-07 21:39:38,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:39:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-01-07 21:39:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-01-07 21:39:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-07 21:39:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-01-07 21:39:39,207 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-01-07 21:39:39,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:39,207 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-01-07 21:39:39,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:39:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-01-07 21:39:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:39,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:39,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:39,208 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:39,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:39,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-01-07 21:39:39,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:39,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:39,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 21:39:39,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:39,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:39,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:39,344 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-01-07 21:39:39,345 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:39,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:39,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:39,347 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:39:39,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:39,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:39,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:39,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:39:39,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:39,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:39,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:39,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:39,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:39:39,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:39:39,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 21:39:39,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-07 21:39:39,394 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:39,408 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:39,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:39,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:39,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:39,451 INFO L267 ElimStorePlain]: Start 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-07 21:39:39,451 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-07 21:39:39,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-07 21:39:39,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:39,497 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-07 21:39:39,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-07 21:39:39,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:39,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-07 21:39:39,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:39,540 INFO L267 ElimStorePlain]: Start 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-07 21:39:39,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-07 21:39:39,555 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-07 21:39:39,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:39,596 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-07 21:39:39,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:39,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:39:39,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:39,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:39:39,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:39:39,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:39:39,617 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-01-07 21:39:40,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:40,350 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-01-07 21:39:40,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:39:40,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-07 21:39:40,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:40,352 INFO L225 Difference]: With dead ends: 267 [2019-01-07 21:39:40,352 INFO L226 Difference]: Without dead ends: 258 [2019-01-07 21:39:40,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:39:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-07 21:39:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-07 21:39:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-07 21:39:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-01-07 21:39:40,933 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-01-07 21:39:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:40,933 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-01-07 21:39:40,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:39:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-01-07 21:39:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:40,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:40,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:40,934 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:40,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:40,934 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-01-07 21:39:40,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:40,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:40,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:40,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:40,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:41,120 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-07 21:39:41,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:41,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:41,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:41,120 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-01-07 21:39:41,121 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:41,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:41,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:41,123 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:39:41,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:41,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:41,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:41,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:39:41,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:41,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:41,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:41,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:41,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:41,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:41,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:41,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:41,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,262 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:41,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,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, 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-07 21:39:41,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,338 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-07 21:39:41,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:41,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-07 21:39:41,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,420 INFO L267 ElimStorePlain]: Start 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-07 21:39:41,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:41,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,462 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:41,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-07 21:39:41,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,512 INFO L267 ElimStorePlain]: Start 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-07 21:39:41,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:41,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,552 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:41,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:41,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:41,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:41,604 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-07 21:39:41,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:39:41,630 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-07 21:39:41,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:41,702 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-07 21:39:41,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:41,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:39:41,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:41,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:39:41,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:39:41,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:39:41,722 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-01-07 21:39:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:43,034 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-01-07 21:39:43,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:39:43,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-07 21:39:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:43,036 INFO L225 Difference]: With dead ends: 309 [2019-01-07 21:39:43,036 INFO L226 Difference]: Without dead ends: 306 [2019-01-07 21:39:43,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:39:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-07 21:39:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-01-07 21:39:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-07 21:39:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-01-07 21:39:43,693 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-01-07 21:39:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:43,694 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-01-07 21:39:43,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:39:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-01-07 21:39:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:43,694 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:43,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:43,694 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:43,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-01-07 21:39:43,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:43,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:43,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:43,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:43,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:43,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:43,800 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-01-07 21:39:43,801 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:43,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:43,804 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:43,804 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:39:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:43,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:43,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:43,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:39:43,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:43,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:43,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:43,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:43,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:39:43,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, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-07 21:39:43,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-07 21:39:43,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:43,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-07 21:39:43,878 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:43,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:43,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:43,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:43,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:43,936 INFO L267 ElimStorePlain]: Start 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-07 21:39:43,937 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-07 21:39:43,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:43,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:43,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-07 21:39:43,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:43,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:43,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-07 21:39:43,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:43,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:43,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:43,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:43,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:43,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:43,997 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-07 21:39:43,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-07 21:39:44,010 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-07 21:39:44,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:44,026 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-07 21:39:44,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:44,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-07 21:39:44,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:44,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:39:44,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:39:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:39:44,045 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-01-07 21:39:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:45,314 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-01-07 21:39:45,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:39:45,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-07 21:39:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:45,315 INFO L225 Difference]: With dead ends: 379 [2019-01-07 21:39:45,316 INFO L226 Difference]: Without dead ends: 366 [2019-01-07 21:39:45,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:39:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-07 21:39:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-01-07 21:39:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-07 21:39:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-01-07 21:39:46,082 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-01-07 21:39:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:46,082 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-01-07 21:39:46,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:39:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-01-07 21:39:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:46,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:46,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:46,083 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-01-07 21:39:46,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:46,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:46,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:46,234 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-07 21:39:46,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:46,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:46,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:46,235 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-01-07 21:39:46,236 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:46,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:46,238 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:46,238 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:39:46,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:46,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:46,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:46,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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:39:46,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:46,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:46,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:46,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:46,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:39:46,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:39:46,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:39:46,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:39:46,305 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:46,323 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:46,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:46,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:46,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:46,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:46,431 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:39:46,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:39:46,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:46,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:46,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:39:46,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 21:39:46,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:46,562 INFO L267 ElimStorePlain]: Start 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-07 21:39:46,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:39:46,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,590 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:46,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-07 21:39:46,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:46,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:46,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:39:46,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:46,652 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:46,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-07 21:39:46,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:46,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:46,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:39:46,710 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-07 21:39:46,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:46,754 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-07 21:39:46,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:46,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-07 21:39:46,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:46,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:39:46,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:39:46,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:39:46,775 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-01-07 21:39:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:48,564 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-01-07 21:39:48,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:39:48,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-07 21:39:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:48,565 INFO L225 Difference]: With dead ends: 371 [2019-01-07 21:39:48,565 INFO L226 Difference]: Without dead ends: 366 [2019-01-07 21:39:48,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:39:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-07 21:39:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-01-07 21:39:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-07 21:39:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-01-07 21:39:49,525 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-01-07 21:39:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:49,526 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-01-07 21:39:49,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:39:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-01-07 21:39:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:49,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:49,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:49,526 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:49,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-01-07 21:39:49,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:49,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:49,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:49,652 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-07 21:39:49,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:49,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:49,653 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:49,653 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-01-07 21:39:49,654 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:49,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:49,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:49,656 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:39:49,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:49,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:49,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:49,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:39:49,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:49,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:49,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:49,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:49,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:49,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:49,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:49,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:49,708 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:49,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:49,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:49,761 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:49,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:49,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:49,789 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:49,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,825 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-07 21:39:49,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:49,863 INFO L267 ElimStorePlain]: Start 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-07 21:39:49,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:49,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,901 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:49,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, 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-07 21:39:49,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:49,945 INFO L267 ElimStorePlain]: Start 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-07 21:39:49,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:49,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:49,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:39:49,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:50,029 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-07 21:39:50,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:50,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:50,069 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:50,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:50,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:50,117 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-07 21:39:50,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:39:50,140 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-07 21:39:50,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:50,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:50,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:39:50,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:50,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:39:50,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:39:50,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:39:50,206 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-01-07 21:39:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:51,769 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-01-07 21:39:51,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:39:51,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-07 21:39:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:51,771 INFO L225 Difference]: With dead ends: 285 [2019-01-07 21:39:51,771 INFO L226 Difference]: Without dead ends: 284 [2019-01-07 21:39:51,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:39:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-07 21:39:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-01-07 21:39:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-07 21:39:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-01-07 21:39:52,796 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-01-07 21:39:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:52,796 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-01-07 21:39:52,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:39:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-01-07 21:39:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:52,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:52,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:52,797 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:52,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-01-07 21:39:52,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:52,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:52,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:52,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:52,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:52,919 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-07 21:39:52,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:52,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:52,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:39:52,920 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-07 21:39:52,920 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:39:52,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:39:52,922 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:39:52,922 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:39:52,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:52,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:39:52,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:52,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:39:52,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:52,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:52,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:52,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:52,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:52,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:52,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:52,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:52,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:52,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:53,001 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:53,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:53,028 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:53,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:53,056 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-07 21:39:53,057 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:53,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:39:53,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:53,133 INFO L267 ElimStorePlain]: Start 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-07 21:39:53,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:53,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,169 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:53,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:39:53,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:53,212 INFO L267 ElimStorePlain]: Start 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-07 21:39:53,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:53,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:53,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:39:53,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:53,299 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-07 21:39:53,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:53,325 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-07 21:39:53,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:53,358 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-07 21:39:53,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:39:53,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:53,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:39:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:39:53,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:39:53,376 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-01-07 21:39:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:54,838 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-01-07 21:39:54,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:39:54,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-07 21:39:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:54,840 INFO L225 Difference]: With dead ends: 281 [2019-01-07 21:39:54,840 INFO L226 Difference]: Without dead ends: 274 [2019-01-07 21:39:54,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:39:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-07 21:39:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-01-07 21:39:55,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-07 21:39:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-01-07 21:39:55,882 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-01-07 21:39:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:55,882 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-01-07 21:39:55,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:39:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-01-07 21:39:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:55,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:55,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:55,883 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:55,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-01-07 21:39:55,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:55,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:55,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:56,051 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-07 21:39:56,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:56,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:56,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:56,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:56,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:56,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:39:56,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:39:56,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:39:56,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:39:56,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:56,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:56,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:39:56,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:39:56,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:39:56,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:39:56,108 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:56,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:56,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:56,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:56,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:56,190 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-07 21:39:56,191 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:39:56,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,227 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-07 21:39:56,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:56,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:56,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:56,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,310 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:56,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, 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-07 21:39:56,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:56,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:56,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:56,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,393 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:39:56,394 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-07 21:39:56,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:56,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:56,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:56,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:56,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:39:56,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:56,522 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-07 21:39:56,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:39:56,548 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-07 21:39:56,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:56,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:56,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:39:56,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:56,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:39:56,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:39:56,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:39:56,649 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-01-07 21:39:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:58,437 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-01-07 21:39:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:39:58,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-07 21:39:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:58,439 INFO L225 Difference]: With dead ends: 295 [2019-01-07 21:39:58,439 INFO L226 Difference]: Without dead ends: 288 [2019-01-07 21:39:58,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:39:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-07 21:39:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-01-07 21:39:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-07 21:39:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-01-07 21:39:59,504 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-01-07 21:39:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:59,504 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-01-07 21:39:59,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:39:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-01-07 21:39:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:39:59,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:59,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:39:59,505 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:39:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-01-07 21:39:59,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:59,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:59,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:59,662 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-07 21:39:59,745 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-07 21:39:59,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:59,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:59,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:59,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:59,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:59,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:39:59,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:39:59,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:39:59,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:39:59,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:59,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:59,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:39:59,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:39:59,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:39:59,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:39:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:39:59,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:59,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:59,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:59,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:59,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:59,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:39:59,915 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:39:59,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:39:59,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:39:59,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:59,986 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-07 21:39:59,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:00,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-07 21:40:00,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:00,048 INFO L267 ElimStorePlain]: Start 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-07 21:40:00,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:00,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,085 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:00,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:40:00,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:00,118 INFO L267 ElimStorePlain]: Start 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-07 21:40:00,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:40:00,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:00,152 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:00,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-07 21:40:00,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:00,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:00,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:40:00,206 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-07 21:40:00,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:00,262 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-07 21:40:00,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:00,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:40:00,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:00,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:40:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:40:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:40:00,281 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-01-07 21:40:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:02,382 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-01-07 21:40:02,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:40:02,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-07 21:40:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:02,384 INFO L225 Difference]: With dead ends: 370 [2019-01-07 21:40:02,384 INFO L226 Difference]: Without dead ends: 363 [2019-01-07 21:40:02,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:40:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-07 21:40:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-01-07 21:40:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-07 21:40:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-01-07 21:40:03,636 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-01-07 21:40:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:03,636 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-01-07 21:40:03,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:40:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-01-07 21:40:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:03,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:03,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:03,637 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:03,637 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-01-07 21:40:03,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:03,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:40:03,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:03,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:03,800 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-01-07 21:40:03,934 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-07 21:40:03,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:03,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:03,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:03,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:03,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:03,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:03,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:40:03,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:40:03,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:40:03,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:40:03,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:03,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:40:03,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:03,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:40:03,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:03,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:03,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:40:03,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:03,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:03,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:03,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:40:03,980 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:03,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:04,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:04,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:04,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:04,045 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-07 21:40:04,046 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:40:04,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:40:04,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:04,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:04,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,155 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:04,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-07 21:40:04,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:04,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:04,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:04,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:40:04,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:04,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-07 21:40:04,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:04,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,276 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:04,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:04,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-07 21:40:04,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:04,312 INFO L267 ElimStorePlain]: Start 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-07 21:40:04,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:40:04,335 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-07 21:40:04,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:04,389 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-07 21:40:04,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:04,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:40:04,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:04,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:40:04,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:40:04,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:40:04,408 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-01-07 21:40:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:06,373 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-01-07 21:40:06,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:40:06,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-07 21:40:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:06,375 INFO L225 Difference]: With dead ends: 349 [2019-01-07 21:40:06,375 INFO L226 Difference]: Without dead ends: 344 [2019-01-07 21:40:06,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:40:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-07 21:40:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-01-07 21:40:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-07 21:40:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-01-07 21:40:07,529 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-01-07 21:40:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:07,529 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-01-07 21:40:07,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:40:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-01-07 21:40:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:07,530 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:07,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:07,530 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:07,530 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-01-07 21:40:07,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:07,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:40:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:07,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:07,799 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-07 21:40:07,850 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-07 21:40:07,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:07,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:07,851 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:40:07,851 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-07 21:40:07,851 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:07,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:07,853 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:07,853 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:40:07,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:07,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:07,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:07,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:07,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:07,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:07,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:07,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:40:07,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:07,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:40:07,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:07,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:07,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:40:07,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:07,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:07,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:07,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:40:07,899 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:07,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:07,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:07,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:07,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:07,965 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-07 21:40:07,966 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:40:08,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:40:08,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:08,032 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-07 21:40:08,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:08,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,062 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:08,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-07 21:40:08,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:08,092 INFO L267 ElimStorePlain]: Start 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-07 21:40:08,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:08,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:08,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-07 21:40:08,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:08,154 INFO L267 ElimStorePlain]: Start 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-07 21:40:08,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:08,176 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-07 21:40:08,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:08,208 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-07 21:40:08,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:08,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:40:08,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:08,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:40:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:40:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:40:08,228 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-01-07 21:40:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:09,765 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-01-07 21:40:09,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:40:09,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-07 21:40:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:09,767 INFO L225 Difference]: With dead ends: 257 [2019-01-07 21:40:09,767 INFO L226 Difference]: Without dead ends: 250 [2019-01-07 21:40:09,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:40:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-07 21:40:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-01-07 21:40:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-07 21:40:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-01-07 21:40:10,921 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-01-07 21:40:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:10,921 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-01-07 21:40:10,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:40:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-01-07 21:40:10,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:10,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:10,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:10,922 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:10,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:10,922 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-01-07 21:40:10,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:10,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:10,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:10,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:10,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:11,053 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-07 21:40:11,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:11,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:11,054 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:40:11,054 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-01-07 21:40:11,054 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:11,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:11,056 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:11,056 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:40:11,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:11,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:11,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:11,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:11,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:11,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:11,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:11,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:11,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:40:11,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:40:11,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:40:11,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:40:11,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:11,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:11,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:11,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:11,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:11,210 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-07 21:40:11,210 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:40:11,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,247 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-07 21:40:11,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:11,290 INFO L267 ElimStorePlain]: Start 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-07 21:40:11,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:11,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-07 21:40:11,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:11,378 INFO L267 ElimStorePlain]: Start 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-07 21:40:11,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:11,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,416 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:11,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:40:11,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:11,468 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-07 21:40:11,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:40:11,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:11,513 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:11,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-07 21:40:11,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:11,565 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-07 21:40:11,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:40:11,586 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-07 21:40:11,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:11,633 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-07 21:40:11,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:11,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:40:11,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:11,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:40:11,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:40:11,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:40:11,653 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-01-07 21:40:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:13,683 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-01-07 21:40:13,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:40:13,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-07 21:40:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:13,685 INFO L225 Difference]: With dead ends: 316 [2019-01-07 21:40:13,686 INFO L226 Difference]: Without dead ends: 315 [2019-01-07 21:40:13,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:40:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-07 21:40:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-01-07 21:40:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-07 21:40:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-01-07 21:40:14,803 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-01-07 21:40:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:14,803 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-01-07 21:40:14,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:40:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-01-07 21:40:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:14,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:14,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:14,804 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:14,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:14,804 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-01-07 21:40:14,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:14,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:14,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:14,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:14,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:15,013 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-07 21:40:15,063 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-07 21:40:15,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:15,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:15,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:40:15,064 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-07 21:40:15,064 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:15,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:15,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:15,067 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:40:15,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:15,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:15,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:15,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:15,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:15,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:15,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:15,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:15,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:40:15,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:40:15,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:40:15,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:40:15,206 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:15,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:15,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:15,260 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:15,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:15,289 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-07 21:40:15,290 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:40:15,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:40:15,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:15,365 INFO L267 ElimStorePlain]: Start 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-07 21:40:15,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:15,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,648 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:15,648 INFO L303 Elim1Store]: Index analysis took 257 ms [2019-01-07 21:40:15,649 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-07 21:40:15,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:15,695 INFO L267 ElimStorePlain]: Start 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-07 21:40:15,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:15,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:15,742 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:15,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:40:15,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:15,786 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-07 21:40:15,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:15,809 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-07 21:40:15,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:15,858 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-07 21:40:15,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:15,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:40:15,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:15,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:40:15,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:40:15,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:40:15,878 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-01-07 21:40:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:17,420 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-01-07 21:40:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:40:17,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-07 21:40:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:17,421 INFO L225 Difference]: With dead ends: 253 [2019-01-07 21:40:17,421 INFO L226 Difference]: Without dead ends: 246 [2019-01-07 21:40:17,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:40:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-07 21:40:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-01-07 21:40:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-01-07 21:40:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-01-07 21:40:18,575 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-01-07 21:40:18,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:18,576 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-01-07 21:40:18,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:40:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-01-07 21:40:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:18,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:18,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:18,576 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:18,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:18,577 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-01-07 21:40:18,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:18,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:18,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:18,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:18,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:40:18,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:18,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:18,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:18,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:18,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:18,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:18,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:40:18,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:40:18,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:40:18,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:40:18,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:18,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:18,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:40:18,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:40:18,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,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 25 treesize of output 51 [2019-01-07 21:40:18,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:40:18,815 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:18,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:18,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:18,867 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:18,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:18,896 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-07 21:40:18,896 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:40:18,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:18,935 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-07 21:40:18,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:18,976 INFO L267 ElimStorePlain]: Start 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-07 21:40:18,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:19,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,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, 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-07 21:40:19,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:19,067 INFO L267 ElimStorePlain]: Start 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-07 21:40:19,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:19,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,113 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:19,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:40:19,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:19,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-07 21:40:19,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:40:19,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:19,231 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:19,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-07 21:40:19,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:19,301 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-07 21:40:19,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:40:19,340 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-07 21:40:19,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:19,463 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-07 21:40:19,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:19,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:40:19,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:19,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:40:19,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:40:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:40:19,482 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-01-07 21:40:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:21,777 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-01-07 21:40:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:40:21,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-07 21:40:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:21,778 INFO L225 Difference]: With dead ends: 332 [2019-01-07 21:40:21,778 INFO L226 Difference]: Without dead ends: 328 [2019-01-07 21:40:21,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:40:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-07 21:40:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-01-07 21:40:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-07 21:40:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-01-07 21:40:22,852 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-01-07 21:40:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:22,852 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-01-07 21:40:22,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:40:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-01-07 21:40:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:22,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:22,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:22,853 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-01-07 21:40:22,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:22,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:22,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:40:22,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:22,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:23,351 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-07 21:40:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:40:23,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:23,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:23,394 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:40:23,395 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-07 21:40:23,395 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:23,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:23,397 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:23,397 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:40:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:23,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:23,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:23,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:23,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:23,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:23,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:23,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:23,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:40:23,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:40:23,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:40:23,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:40:23,436 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:23,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:23,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:23,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:23,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:23,519 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-07 21:40:23,519 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:40:23,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,557 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-07 21:40:23,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:23,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:23,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:23,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,637 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:23,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, 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-07 21:40:23,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:23,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:23,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:23,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:23,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:40:23,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:23,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-07 21:40:23,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:23,795 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-07 21:40:23,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:23,831 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-07 21:40:23,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:23,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:40:23,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:23,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:40:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:40:23,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:40:23,852 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-01-07 21:40:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:25,439 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-01-07 21:40:25,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:40:25,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-07 21:40:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:25,441 INFO L225 Difference]: With dead ends: 242 [2019-01-07 21:40:25,441 INFO L226 Difference]: Without dead ends: 241 [2019-01-07 21:40:25,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:40:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-07 21:40:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-07 21:40:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-07 21:40:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-01-07 21:40:26,604 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-01-07 21:40:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:26,604 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-01-07 21:40:26,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:40:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-01-07 21:40:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:26,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:26,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:26,605 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:26,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-01-07 21:40:26,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:26,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:26,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:26,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:26,770 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-07 21:40:26,830 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-07 21:40:26,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:26,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:26,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:40:26,831 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-07 21:40:26,831 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:26,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:26,833 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:26,833 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:40:26,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:26,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:26,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:26,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:26,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:26,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:26,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:26,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:26,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:40:26,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:26,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:40:26,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:26,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:26,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:40:26,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:26,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:26,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:26,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:40:26,905 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:26,924 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:26,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:26,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:26,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:26,971 INFO L267 ElimStorePlain]: Start 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-07 21:40:26,971 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:40:27,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:40:27,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:27,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:27,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:27,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,064 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:27,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-07 21:40:27,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:27,093 INFO L267 ElimStorePlain]: Start 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-07 21:40:27,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:40:27,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:27,238 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-07 21:40:27,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-07 21:40:27,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:27,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:27,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:40:27,287 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-07 21:40:27,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:27,325 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-07 21:40:27,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:27,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:40:27,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:27,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:40:27,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:40:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:40:27,346 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-01-07 21:40:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:28,988 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-01-07 21:40:28,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:40:28,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-07 21:40:28,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:28,990 INFO L225 Difference]: With dead ends: 254 [2019-01-07 21:40:28,990 INFO L226 Difference]: Without dead ends: 245 [2019-01-07 21:40:28,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:40:28,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-07 21:40:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-01-07 21:40:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-07 21:40:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-01-07 21:40:30,174 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-01-07 21:40:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:30,174 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-01-07 21:40:30,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:40:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-01-07 21:40:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:30,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:30,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:30,175 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-01-07 21:40:30,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:30,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:30,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:30,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:30,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:30,348 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-07 21:40:30,403 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-07 21:40:30,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:30,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:30,403 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:40:30,404 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-01-07 21:40:30,404 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:30,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:30,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:30,407 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:40:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:30,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:30,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:30,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:30,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:30,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:30,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:30,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:30,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:40:30,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:40:30,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:40:30,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:40:30,449 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:30,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:30,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:30,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:30,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:30,515 INFO L267 ElimStorePlain]: Start 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-07 21:40:30,516 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:40:30,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:40:30,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:30,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:30,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:30,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,613 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:30,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-07 21:40:30,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:30,639 INFO L267 ElimStorePlain]: Start 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-07 21:40:30,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:40:30,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:30,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-07 21:40:30,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:30,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:30,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:40:30,721 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-07 21:40:30,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:30,753 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-07 21:40:30,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:30,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:40:30,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:30,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:40:30,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:40:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:40:30,773 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-01-07 21:40:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:32,380 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-01-07 21:40:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:40:32,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-07 21:40:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:32,381 INFO L225 Difference]: With dead ends: 249 [2019-01-07 21:40:32,382 INFO L226 Difference]: Without dead ends: 248 [2019-01-07 21:40:32,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:40:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-07 21:40:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-01-07 21:40:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-07 21:40:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-01-07 21:40:33,584 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-01-07 21:40:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:33,585 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-01-07 21:40:33,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:40:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-01-07 21:40:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:33,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:33,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:33,585 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:33,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:33,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-01-07 21:40:33,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:33,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:33,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:33,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:33,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:33,688 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-07 21:40:33,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:33,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:33,689 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:40:33,689 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-01-07 21:40:33,689 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:33,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:33,691 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:33,691 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:40:33,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:33,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:33,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:33,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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:33,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:33,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:33,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:33,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:40:33,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:40:33,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:40:33,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:40:33,729 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:33,759 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:33,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:33,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:33,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:33,813 INFO L267 ElimStorePlain]: Start 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-07 21:40:33,814 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-07 21:40:33,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,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-07 21:40:33,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:33,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:33,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:33,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:33,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:40:33,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:33,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:33,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:40:33,994 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-07 21:40:33,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:34,091 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-07 21:40:34,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:34,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:40:34,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:34,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:40:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:40:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:40:34,111 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-01-07 21:40:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:35,598 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-01-07 21:40:35,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:40:35,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-07 21:40:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:35,600 INFO L225 Difference]: With dead ends: 239 [2019-01-07 21:40:35,600 INFO L226 Difference]: Without dead ends: 230 [2019-01-07 21:40:35,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:40:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-07 21:40:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-07 21:40:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-07 21:40:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-01-07 21:40:36,833 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-01-07 21:40:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:36,833 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-01-07 21:40:36,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:40:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-01-07 21:40:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:40:36,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:36,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:36,834 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-07 21:40:36,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:36,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:36,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:36,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:36,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:36,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-07 21:40:36,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:36,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:36,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 21:40:36,924 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-01-07 21:40:36,924 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:36,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:36,926 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:36,926 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:40:36,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:36,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:36,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:36,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:36,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:36,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:36,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:36,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:36,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:40:36,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:36,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:40:36,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:36,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:36,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:40:36,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:36,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:36,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:36,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:40:36,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:36,993 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:37,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:37,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:37,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:37,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:37,040 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:40:37,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:40:37,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:37,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:37,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:37,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:37,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-07 21:40:37,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:37,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-07 21:40:37,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:40:37,176 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-07 21:40:37,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:37,193 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-07 21:40:37,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:37,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-07 21:40:37,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:37,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:40:37,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:40:37,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:40:37,213 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-01-07 21:40:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:38,569 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-01-07 21:40:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:40:38,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-07 21:40:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:38,571 INFO L225 Difference]: With dead ends: 236 [2019-01-07 21:40:38,571 INFO L226 Difference]: Without dead ends: 227 [2019-01-07 21:40:38,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:40:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-07 21:40:39,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-01-07 21:40:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-07 21:40:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-01-07 21:40:39,760 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-01-07 21:40:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:39,760 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-01-07 21:40:39,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:40:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-01-07 21:40:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:40:39,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:39,760 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:39,761 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:39,761 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-01-07 21:40:39,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:39,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:39,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:39,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:40,286 WARN L181 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-07 21:40:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:40:40,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:40,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:40,423 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:40:40,423 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-01-07 21:40:40,424 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:40,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:40,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:40,426 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:40:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:40,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:40,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:40,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:40,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:40,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:40,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:40,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:40,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:40:40,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:40:40,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:40:40,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:40:40,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:40,491 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:40,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:40,512 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:40,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:40,537 INFO L267 ElimStorePlain]: Start 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-07 21:40:40,537 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:40:40,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:40:40,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:40,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:40,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:40,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-07 21:40:40,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:40,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:40,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-07 21:40:40,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:40,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:40:40,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:40,728 INFO L267 ElimStorePlain]: Start 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-07 21:40:40,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-07 21:40:40,749 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-07 21:40:40,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:40,784 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-07 21:40:40,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:40,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:40:40,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:40,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:40:40,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:40:40,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:40:40,804 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-01-07 21:40:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:42,182 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-01-07 21:40:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:40:42,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-07 21:40:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:42,184 INFO L225 Difference]: With dead ends: 236 [2019-01-07 21:40:42,184 INFO L226 Difference]: Without dead ends: 227 [2019-01-07 21:40:42,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:40:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-07 21:40:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-01-07 21:40:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-07 21:40:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-01-07 21:40:43,396 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-01-07 21:40:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:43,396 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-01-07 21:40:43,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:40:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-01-07 21:40:43,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:40:43,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:43,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:43,397 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-01-07 21:40:43,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:43,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:43,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:43,559 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-07 21:40:43,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:43,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:43,559 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:40:43,559 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-07 21:40:43,560 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:43,560 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:43,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:43,561 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:40:43,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:43,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:43,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:43,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:43,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:43,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:43,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:43,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:43,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:40:43,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:40:43,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:40:43,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,762 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-07 21:40:43,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:40:43,763 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:43,871 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:43,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:43,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:43,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:43,927 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-07 21:40:43,927 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:40:43,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:43,963 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-07 21:40:43,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:44,005 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-07 21:40:44,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:44,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:40:44,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:44,088 INFO L267 ElimStorePlain]: Start 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-07 21:40:44,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:40:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,128 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:44,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:40:44,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:44,178 INFO L267 ElimStorePlain]: Start 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-07 21:40:44,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:40:44,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:44,219 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:44,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, 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-07 21:40:44,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:44,271 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-07 21:40:44,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:40:44,299 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-07 21:40:44,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:44,354 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-07 21:40:44,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:44,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-07 21:40:44,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:44,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:40:44,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:40:44,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:40:44,375 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-01-07 21:40:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:46,698 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-01-07 21:40:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:40:46,699 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-07 21:40:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:46,700 INFO L225 Difference]: With dead ends: 326 [2019-01-07 21:40:46,700 INFO L226 Difference]: Without dead ends: 316 [2019-01-07 21:40:46,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:40:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-01-07 21:40:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-01-07 21:40:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-07 21:40:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-01-07 21:40:47,977 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-01-07 21:40:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:47,977 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-01-07 21:40:47,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:40:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-01-07 21:40:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:40:47,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:47,978 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:47,978 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-01-07 21:40:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:47,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:47,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:48,095 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-07 21:40:48,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:48,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:48,096 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:40:48,096 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-07 21:40:48,096 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:48,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:48,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:48,099 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:40:48,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:48,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:48,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:48,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:48,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:48,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:48,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:48,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:48,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:40:48,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:40:48,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:40:48,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:40:48,154 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:48,175 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:48,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:48,196 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:48,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:48,221 INFO L267 ElimStorePlain]: Start 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-07 21:40:48,222 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:40:48,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-07 21:40:48,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:48,282 INFO L267 ElimStorePlain]: Start 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-07 21:40:48,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:48,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,306 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:48,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-07 21:40:48,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:48,337 INFO L267 ElimStorePlain]: Start 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-07 21:40:48,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:40:48,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:48,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-07 21:40:48,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:48,396 INFO L267 ElimStorePlain]: Start 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-07 21:40:48,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:40:48,415 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-07 21:40:48,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:48,441 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-07 21:40:48,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:48,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-07 21:40:48,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:48,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:40:48,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:40:48,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:40:48,461 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-01-07 21:40:50,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:50,559 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-01-07 21:40:50,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:40:50,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-07 21:40:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:50,561 INFO L225 Difference]: With dead ends: 288 [2019-01-07 21:40:50,561 INFO L226 Difference]: Without dead ends: 279 [2019-01-07 21:40:50,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:40:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-07 21:40:52,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-01-07 21:40:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-07 21:40:52,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-01-07 21:40:52,262 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-01-07 21:40:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:52,262 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-01-07 21:40:52,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:40:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-01-07 21:40:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:40:52,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:52,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:52,264 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-07 21:40:52,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:52,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:52,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:52,512 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:40:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:40:52,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:52,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:52,557 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:40:52,558 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-07 21:40:52,558 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:52,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:52,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:52,561 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:40:52,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:52,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:52,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:52,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:52,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:52,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:52,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:52,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:52,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:40:52,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:40:52,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:40:52,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:40:52,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:52,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:52,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:52,653 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:52,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:52,680 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-07 21:40:52,681 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:40:52,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:40:52,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:52,747 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-07 21:40:52,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:40:52,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-07 21:40:52,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:52,811 INFO L267 ElimStorePlain]: Start 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-07 21:40:52,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:40:52,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,839 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:52,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:52,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-07 21:40:52,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:52,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:40:52,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:40:52,898 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-07 21:40:52,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:52,934 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-07 21:40:52,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:52,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:40:52,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:52,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:40:52,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:40:52,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:40:52,954 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-01-07 21:40:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:55,106 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-01-07 21:40:55,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:40:55,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-07 21:40:55,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:55,108 INFO L225 Difference]: With dead ends: 277 [2019-01-07 21:40:55,108 INFO L226 Difference]: Without dead ends: 268 [2019-01-07 21:40:55,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:40:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-01-07 21:40:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-01-07 21:40:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-07 21:40:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-01-07 21:40:56,871 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-01-07 21:40:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:56,871 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-01-07 21:40:56,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:40:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-01-07 21:40:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:40:56,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:56,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:40:56,872 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:40:56,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:56,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-01-07 21:40:56,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:56,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:56,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:57,102 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2019-01-07 21:40:57,217 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-07 21:40:57,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:57,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:57,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:40:57,217 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-01-07 21:40:57,218 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:40:57,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:40:57,219 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:40:57,220 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-07 21:40:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:57,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:40:57,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:57,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:40:57,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:57,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:57,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:57,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:40:57,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:40:57,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,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 23 treesize of output 37 [2019-01-07 21:40:57,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:40:57,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:40:57,264 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,291 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,344 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:40:57,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,381 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-07 21:40:57,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,422 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-07 21:40:57,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:57,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,463 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:57,464 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-07 21:40:57,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,506 INFO L267 ElimStorePlain]: Start 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-07 21:40:57,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:57,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-07 21:40:57,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,593 INFO L267 ElimStorePlain]: Start 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-07 21:40:57,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:40:57,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,635 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:57,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,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, 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-07 21:40:57,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,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-07 21:40:57,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:40:57,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:40:57,731 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:40:57,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:40:57,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:57,783 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-07 21:40:57,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:40:57,807 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-07 21:40:57,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:57,896 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-07 21:40:57,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:57,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-07 21:40:57,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:57,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:40:57,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:40:57,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:40:57,916 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-01-07 21:41:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:01,102 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-01-07 21:41:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:41:01,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-07 21:41:01,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:01,104 INFO L225 Difference]: With dead ends: 361 [2019-01-07 21:41:01,104 INFO L226 Difference]: Without dead ends: 356 [2019-01-07 21:41:01,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:41:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-07 21:41:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-01-07 21:41:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-07 21:41:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-01-07 21:41:02,957 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-01-07 21:41:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:02,957 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-01-07 21:41:02,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:41:02,957 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-01-07 21:41:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:02,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:02,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:02,958 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:02,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-01-07 21:41:02,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:02,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:02,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:02,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 21:41:03,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:03,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:03,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:03,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:03,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:03,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:03,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:41:03,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:41:03,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:41:03,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:03,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:03,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:03,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:41:03,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:41:03,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:41:03,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:41:03,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:03,257 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:03,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:03,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:03,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:03,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:03,312 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:41:03,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:03,351 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-07 21:41:03,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:03,848 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-07 21:41:03,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:04,172 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-07 21:41:04,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:04,452 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:04,453 INFO L303 Elim1Store]: Index analysis took 278 ms [2019-01-07 21:41:04,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, 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-07 21:41:04,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:04,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:04,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-07 21:41:05,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:05,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:05,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:05,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,149 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:05,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 38 treesize of output 98 [2019-01-07 21:41:05,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:05,200 INFO L267 ElimStorePlain]: Start 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-07 21:41:05,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:41:05,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,241 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:05,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:05,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:41:05,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:05,394 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-07 21:41:05,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:41:05,426 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-07 21:41:05,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:05,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:05,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-07 21:41:05,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:05,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:41:05,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:41:05,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:41:05,604 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-01-07 21:41:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:08,739 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-01-07 21:41:08,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:41:08,740 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-07 21:41:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:08,741 INFO L225 Difference]: With dead ends: 357 [2019-01-07 21:41:08,742 INFO L226 Difference]: Without dead ends: 352 [2019-01-07 21:41:08,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:41:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-07 21:41:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-01-07 21:41:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-07 21:41:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-01-07 21:41:10,432 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-01-07 21:41:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:10,432 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-01-07 21:41:10,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:41:10,432 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-01-07 21:41:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:10,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:10,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:10,433 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:10,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-01-07 21:41:10,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:10,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:10,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:10,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:10,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:10,804 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-07 21:41:10,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:10,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:10,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:10,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:10,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:10,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:10,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:41:10,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:41:10,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:41:10,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:10,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:10,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:10,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:41:10,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:41:10,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,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 25 treesize of output 51 [2019-01-07 21:41:10,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:10,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:41:10,905 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:10,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:10,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:10,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:10,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:10,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:10,985 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:41:11,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,023 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-07 21:41:11,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:11,063 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-07 21:41:11,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:11,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,100 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:11,101 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-07 21:41:11,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:11,144 INFO L267 ElimStorePlain]: Start 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-07 21:41:11,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:11,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:41:11,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:11,237 INFO L267 ElimStorePlain]: Start 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-07 21:41:11,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:11,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,280 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:11,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, 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-07 21:41:11,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:11,328 INFO L267 ElimStorePlain]: Start 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-07 21:41:11,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:41:11,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:11,378 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:11,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-07 21:41:11,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:11,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:11,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:41:11,453 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-07 21:41:11,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:11,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:11,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-07 21:41:11,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:11,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:41:11,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:41:11,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:41:11,561 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-01-07 21:41:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:13,973 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-01-07 21:41:13,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:41:13,974 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-01-07 21:41:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:13,975 INFO L225 Difference]: With dead ends: 260 [2019-01-07 21:41:13,975 INFO L226 Difference]: Without dead ends: 253 [2019-01-07 21:41:13,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-01-07 21:41:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-07 21:41:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-01-07 21:41:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-07 21:41:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-01-07 21:41:15,091 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-01-07 21:41:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:15,091 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-01-07 21:41:15,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:41:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-01-07 21:41:15,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:15,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:15,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:15,092 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:15,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:15,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-01-07 21:41:15,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:15,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:15,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:15,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:15,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:15,250 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-07 21:41:15,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:15,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:15,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:41:15,251 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-07 21:41:15,251 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:15,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:15,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:15,253 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:41:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:15,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:15,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:15,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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:15,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:15,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:15,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:15,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 18 treesize of output 21 [2019-01-07 21:41:15,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:41:15,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:41:15,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:41:15,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:41:15,319 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:15,337 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:15,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:15,359 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:15,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:15,385 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-07 21:41:15,385 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:41:15,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:41:15,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:15,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:15,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:41:15,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-07 21:41:15,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:15,559 INFO L267 ElimStorePlain]: Start 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-07 21:41:15,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:41:15,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,618 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:15,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-07 21:41:15,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:15,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:15,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:41:15,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:15,717 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:15,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, 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-07 21:41:15,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:15,765 INFO L267 ElimStorePlain]: Start 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-07 21:41:15,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:41:15,807 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-07 21:41:15,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:15,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:15,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:41:15,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:15,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:41:15,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:41:15,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:41:15,887 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-01-07 21:41:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:17,869 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-01-07 21:41:17,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:41:17,870 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-07 21:41:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:17,871 INFO L225 Difference]: With dead ends: 202 [2019-01-07 21:41:17,871 INFO L226 Difference]: Without dead ends: 195 [2019-01-07 21:41:17,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:41:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-07 21:41:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-01-07 21:41:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-07 21:41:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-01-07 21:41:19,207 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-01-07 21:41:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:19,207 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-01-07 21:41:19,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:41:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-01-07 21:41:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:19,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:19,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:19,208 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:19,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:19,208 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-01-07 21:41:19,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:19,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:19,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:19,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:19,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:41:19,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:19,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:19,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:41:19,417 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-07 21:41:19,418 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:19,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:19,419 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:19,420 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:41:19,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:19,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:19,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:19,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:19,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:19,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:19,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:19,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:19,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:41:19,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:41:19,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:41:19,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:41:19,584 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:19,613 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:19,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:19,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:19,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:19,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:19,666 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:41:19,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,702 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-07 21:41:19,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:19,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:19,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:19,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:41:19,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:19,837 INFO L267 ElimStorePlain]: Start 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-07 21:41:19,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:19,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,877 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:19,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-07 21:41:19,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:19,927 INFO L267 ElimStorePlain]: Start 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-07 21:41:19,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:41:19,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:19,968 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:19,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:41:19,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:20,018 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-07 21:41:20,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:41:20,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-07 21:41:20,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:20,098 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-07 21:41:20,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:20,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:41:20,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:20,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:41:20,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:41:20,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:41:20,118 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-01-07 21:41:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:22,173 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-01-07 21:41:22,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:41:22,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-07 21:41:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:22,174 INFO L225 Difference]: With dead ends: 199 [2019-01-07 21:41:22,175 INFO L226 Difference]: Without dead ends: 192 [2019-01-07 21:41:22,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:41:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-07 21:41:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-01-07 21:41:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-07 21:41:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-01-07 21:41:23,449 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-01-07 21:41:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:23,449 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-01-07 21:41:23,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:41:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-01-07 21:41:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:23,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:23,449 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:23,450 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:23,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-07 21:41:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:23,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:23,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:23,516 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-07 21:41:23,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:23,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:23,517 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:41:23,517 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-07 21:41:23,518 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:23,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:23,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:23,520 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 21:41:23,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:23,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:23,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:23,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:23,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:23,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:23,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:23,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:23,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:41:23,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:41:23,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:41:23,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:41:23,587 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:23,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:23,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:23,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:23,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:23,653 INFO L267 ElimStorePlain]: Start 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-07 21:41:23,653 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-07 21:41:23,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:41:23,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:23,713 INFO L267 ElimStorePlain]: Start 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-07 21:41:23,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:41:23,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-07 21:41:23,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:23,769 INFO L267 ElimStorePlain]: Start 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-07 21:41:23,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:41:23,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:23,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-07 21:41:23,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:23,839 INFO L267 ElimStorePlain]: Start 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-07 21:41:23,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-07 21:41:23,858 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-07 21:41:23,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:23,883 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-07 21:41:23,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:23,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-07 21:41:23,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:23,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:41:23,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:41:23,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-07 21:41:23,904 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-01-07 21:41:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:25,674 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-01-07 21:41:25,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:41:25,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-07 21:41:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:25,675 INFO L225 Difference]: With dead ends: 196 [2019-01-07 21:41:25,676 INFO L226 Difference]: Without dead ends: 187 [2019-01-07 21:41:25,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:41:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-07 21:41:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-01-07 21:41:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-07 21:41:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-01-07 21:41:27,194 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-01-07 21:41:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:27,194 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-01-07 21:41:27,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:41:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-01-07 21:41:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:27,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:27,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:27,195 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-07 21:41:27,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:27,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:27,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:27,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:27,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:41:27,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:27,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:27,296 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:41:27,296 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-07 21:41:27,296 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:27,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:27,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:27,299 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:41:27,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:27,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:27,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:27,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:27,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:27,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:27,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:27,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:27,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:41:27,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:41:27,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:41:27,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:41:27,439 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:27,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:27,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:27,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:27,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:27,520 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-07 21:41:27,520 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:41:27,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,554 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-07 21:41:27,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:27,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:27,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:27,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:41:27,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:27,679 INFO L267 ElimStorePlain]: Start 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-07 21:41:27,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:27,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,713 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:27,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:27,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-07 21:41:27,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:27,764 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-07 21:41:27,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-07 21:41:27,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-07 21:41:27,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:27,836 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-07 21:41:27,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:27,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-07 21:41:27,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:27,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:27,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:41:27,856 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-01-07 21:41:28,458 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-07 21:41:30,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:30,316 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-01-07 21:41:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:41:30,316 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-07 21:41:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:30,317 INFO L225 Difference]: With dead ends: 203 [2019-01-07 21:41:30,318 INFO L226 Difference]: Without dead ends: 194 [2019-01-07 21:41:30,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:41:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-07 21:41:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-01-07 21:41:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-07 21:41:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-01-07 21:41:31,910 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-01-07 21:41:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:31,910 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-01-07 21:41:31,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-01-07 21:41:31,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:31,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:31,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:31,911 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-01-07 21:41:31,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:31,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:31,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:31,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:31,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:32,044 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-07 21:41:32,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:32,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:32,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:41:32,045 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-07 21:41:32,045 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:32,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:32,047 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:32,047 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:41:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:32,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:32,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:32,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:32,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:32,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:32,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:32,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:32,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:41:32,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:41:32,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:41:32,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:41:32,100 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:32,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:32,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:32,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:32,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:32,178 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-07 21:41:32,179 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:41:32,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:41:32,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:32,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:32,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:32,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-07 21:41:32,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:32,350 INFO L267 ElimStorePlain]: Start 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-07 21:41:32,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:32,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,393 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:32,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-07 21:41:32,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:32,446 INFO L267 ElimStorePlain]: Start 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-07 21:41:32,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:41:32,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:32,480 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:32,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:41:32,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:32,531 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-07 21:41:32,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:41:32,555 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-07 21:41:32,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:32,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:32,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:41:32,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:32,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:41:32,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:41:32,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:41:32,623 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-01-07 21:41:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:35,401 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-01-07 21:41:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:41:35,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-07 21:41:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:35,403 INFO L225 Difference]: With dead ends: 269 [2019-01-07 21:41:35,403 INFO L226 Difference]: Without dead ends: 265 [2019-01-07 21:41:35,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:41:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-07 21:41:37,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-01-07 21:41:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-07 21:41:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-01-07 21:41:37,405 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-01-07 21:41:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:37,405 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-01-07 21:41:37,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:41:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-01-07 21:41:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:37,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:37,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:37,406 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:37,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-01-07 21:41:37,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:37,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:37,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:37,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:37,542 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-07 21:41:37,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:37,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:41:37,542 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-01-07 21:41:37,543 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:37,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:37,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:37,544 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 21:41:37,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:37,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:37,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:37,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:37,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:37,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:37,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:37,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:41:37,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,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 23 treesize of output 37 [2019-01-07 21:41:37,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:41:37,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:41:37,590 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,669 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-07 21:41:37,670 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:41:37,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:41:37,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,747 INFO L267 ElimStorePlain]: Start 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-07 21:41:37,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:37,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:41:37,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,838 INFO L267 ElimStorePlain]: Start 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-07 21:41:37,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:37,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,879 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:37,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-07 21:41:37,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,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-07 21:41:37,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:41:37,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:37,974 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:37,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-07 21:41:37,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:38,026 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-07 21:41:38,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:41:38,049 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-07 21:41:38,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:38,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:38,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-07 21:41:38,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:38,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:41:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:41:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:41:38,117 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-01-07 21:41:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:40,849 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-01-07 21:41:40,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:41:40,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-07 21:41:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:40,851 INFO L225 Difference]: With dead ends: 253 [2019-01-07 21:41:40,851 INFO L226 Difference]: Without dead ends: 249 [2019-01-07 21:41:40,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:41:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-07 21:41:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-01-07 21:41:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-07 21:41:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-01-07 21:41:42,820 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-01-07 21:41:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:42,821 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-01-07 21:41:42,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:41:42,821 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-01-07 21:41:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:42,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:42,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:42,821 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:42,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:42,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-01-07 21:41:42,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:42,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:42,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:42,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:42,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 21:41:42,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:42,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:42,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-07 21:41:42,920 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-01-07 21:41:42,920 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:41:42,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:41:42,923 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:41:42,923 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 21:41:42,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:42,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:41:42,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:42,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:42,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:42,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:42,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:42,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:42,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:41:42,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:41:42,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:41:42,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:42,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:41:43,001 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:43,083 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:41:43,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,114 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-07 21:41:43,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:43,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:43,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:41:43,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:43,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:43,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:43,275 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:43,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, 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-07 21:41:43,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:43,324 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-07 21:41:43,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-07 21:41:43,361 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-07 21:41:43,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:43,393 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-07 21:41:43,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:43,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-07 21:41:43,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:43,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:41:43,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:41:43,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:41:43,413 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-01-07 21:41:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:45,776 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-01-07 21:41:45,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:41:45,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-07 21:41:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:45,778 INFO L225 Difference]: With dead ends: 226 [2019-01-07 21:41:45,778 INFO L226 Difference]: Without dead ends: 217 [2019-01-07 21:41:45,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:41:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-07 21:41:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-01-07 21:41:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-07 21:41:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-01-07 21:41:47,770 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-01-07 21:41:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:47,771 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-01-07 21:41:47,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:41:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-01-07 21:41:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:47,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:47,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:47,771 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:47,772 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-01-07 21:41:47,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:47,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:47,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:48,072 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-07 21:41:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 21:41:48,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:48,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:48,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:48,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:48,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:48,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:48,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:41:48,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:41:48,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:41:48,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:48,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:48,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:48,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:41:48,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:41:48,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:41:48,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:41:48,228 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,256 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:48,310 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:41:48,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,351 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-07 21:41:48,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,394 INFO L267 ElimStorePlain]: Start 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-07 21:41:48,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:41:48,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:48,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-07 21:41:48,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,473 INFO L267 ElimStorePlain]: Start 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-07 21:41:48,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:41:48,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-07 21:41:48,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,564 INFO L267 ElimStorePlain]: Start 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-07 21:41:48,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:41:48,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:48,606 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:48,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:41:48,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:48,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-07 21:41:48,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:41:48,683 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-07 21:41:48,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:48,745 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-07 21:41:48,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:48,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:41:48,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:48,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:41:48,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:41:48,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:41:48,766 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-01-07 21:41:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:51,606 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-01-07 21:41:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:41:51,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-07 21:41:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:51,607 INFO L225 Difference]: With dead ends: 258 [2019-01-07 21:41:51,607 INFO L226 Difference]: Without dead ends: 251 [2019-01-07 21:41:51,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-07 21:41:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-07 21:41:53,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-01-07 21:41:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-07 21:41:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-01-07 21:41:53,575 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-01-07 21:41:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:53,575 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-01-07 21:41:53,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:41:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-01-07 21:41:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:53,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:53,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:53,576 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-01-07 21:41:53,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:53,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:53,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:53,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:53,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:53,781 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-07 21:41:53,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:53,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:53,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:53,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:53,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:53,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:53,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:41:53,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:41:53,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:41:53,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:53,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:53,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:53,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:41:53,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:41:53,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:41:53,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:41:53,832 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,849 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,897 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-07 21:41:53,897 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-07 21:41:53,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-07 21:41:53,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:53,970 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-07 21:41:53,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-07 21:41:53,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:53,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,003 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:54,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-07 21:41:54,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,034 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-07 21:41:54,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-07 21:41:54,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-07 21:41:54,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:41:54,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-07 21:41:54,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:54,142 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:41:54,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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-07 21:41:54,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:54,173 INFO L267 ElimStorePlain]: Start 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-07 21:41:54,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-07 21:41:54,196 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-07 21:41:54,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:54,250 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-07 21:41:54,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:54,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:41:54,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:54,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:41:54,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:41:54,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:41:54,271 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-01-07 21:41:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:57,369 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-01-07 21:41:57,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:41:57,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-07 21:41:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:57,370 INFO L225 Difference]: With dead ends: 279 [2019-01-07 21:41:57,371 INFO L226 Difference]: Without dead ends: 272 [2019-01-07 21:41:57,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:41:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-07 21:41:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-01-07 21:41:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-07 21:41:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-01-07 21:41:59,626 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-01-07 21:41:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:59,626 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-01-07 21:41:59,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:41:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-01-07 21:41:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:41:59,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:59,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:41:59,627 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:41:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-01-07 21:41:59,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:59,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:59,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:59,811 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-07 21:41:59,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:59,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:59,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:59,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:59,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:59,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:41:59,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:41:59,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:41:59,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:41:59,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:59,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:59,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:41:59,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:41:59,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:41:59,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:41:59,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:41:59,858 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,885 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:59,940 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-07 21:41:59,941 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-07 21:41:59,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:41:59,981 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-07 21:41:59,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:00,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:42:00,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,064 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:00,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-07 21:42:00,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,107 INFO L267 ElimStorePlain]: Start 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-07 21:42:00,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:42:00,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-07 21:42:00,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,202 INFO L267 ElimStorePlain]: Start 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-07 21:42:00,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:00,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:00,247 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:00,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 106 [2019-01-07 21:42:00,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:00,296 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-07 21:42:00,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:00,324 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-07 21:42:00,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:00,384 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-07 21:42:00,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:00,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:42:00,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:00,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:42:00,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:42:00,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:42:00,403 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-01-07 21:42:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:03,396 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-01-07 21:42:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:42:03,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-07 21:42:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:03,398 INFO L225 Difference]: With dead ends: 256 [2019-01-07 21:42:03,399 INFO L226 Difference]: Without dead ends: 249 [2019-01-07 21:42:03,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:42:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-07 21:42:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-01-07 21:42:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-07 21:42:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-01-07 21:42:05,709 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-01-07 21:42:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:05,709 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-01-07 21:42:05,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:42:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-01-07 21:42:05,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:42:05,710 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:05,711 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:42:05,711 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:05,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-01-07 21:42:05,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:05,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:05,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:42:05,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:05,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 21:42:05,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:05,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:05,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:42:05,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:42:05,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:05,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:42:05,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:42:05,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:42:05,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:42:05,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:42:05,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:05,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:42:05,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-07 21:42:05,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:05,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-07 21:42:05,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:05,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:05,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 21:42:05,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:05,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:05,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:05,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-07 21:42:05,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:05,917 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:05,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:05,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:05,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:05,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:05,964 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-07 21:42:05,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:05,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:05,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:05,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-07 21:42:06,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:06,031 INFO L267 ElimStorePlain]: Start 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-07 21:42:06,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-07 21:42:06,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 21:42:06,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:06,090 INFO L267 ElimStorePlain]: Start 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-07 21:42:06,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-07 21:42:06,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:06,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-07 21:42:06,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:06,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:06,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-07 21:42:06,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:06,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-01-07 21:42:06,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:06,228 INFO L267 ElimStorePlain]: Start 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-07 21:42:06,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2019-01-07 21:42:06,253 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-07 21:42:06,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:06,300 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-07 21:42:06,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:06,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-07 21:42:06,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:06,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:42:06,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:42:06,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-07 21:42:06,321 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-01-07 21:42:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:09,053 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-01-07 21:42:09,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:42:09,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-01-07 21:42:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:09,058 INFO L225 Difference]: With dead ends: 234 [2019-01-07 21:42:09,058 INFO L226 Difference]: Without dead ends: 207 [2019-01-07 21:42:09,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:42:09,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-07 21:42:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-01-07 21:42:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-07 21:42:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-01-07 21:42:09,591 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-01-07 21:42:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:09,591 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-01-07 21:42:09,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:42:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-01-07 21:42:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:42:09,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:09,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:42:09,591 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:09,592 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-01-07 21:42:09,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:09,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:09,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:42:09,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:09,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:09,830 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-07 21:42:09,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:09,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:09,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-07 21:42:09,831 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-07 21:42:09,831 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:42:09,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:42:09,833 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:42:09,833 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-07 21:42:09,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:09,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:42:09,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:09,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:42:09,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:09,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:09,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:09,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:42:09,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:42:09,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:42:09,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:42:09,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:42:09,882 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,909 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:09,966 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:42:09,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:09,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,007 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-07 21:42:10,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,046 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-07 21:42:10,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:42:10,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,089 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:10,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-07 21:42:10,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,141 INFO L267 ElimStorePlain]: Start 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-07 21:42:10,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:42:10,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:42:10,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,226 INFO L267 ElimStorePlain]: Start 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-07 21:42:10,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-07 21:42:10,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,271 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:10,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-07 21:42:10,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,328 INFO L267 ElimStorePlain]: Start 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-07 21:42:10,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-07 21:42:10,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:10,373 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:10,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:42:10,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:10,423 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-07 21:42:10,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:10,455 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-07 21:42:10,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:10,549 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-07 21:42:10,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:10,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-07 21:42:10,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:10,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:42:10,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:42:10,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:42:10,570 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-01-07 21:42:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:12,013 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-01-07 21:42:12,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:42:12,013 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-07 21:42:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:12,014 INFO L225 Difference]: With dead ends: 76 [2019-01-07 21:42:12,014 INFO L226 Difference]: Without dead ends: 69 [2019-01-07 21:42:12,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-01-07 21:42:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-07 21:42:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-01-07 21:42:12,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-07 21:42:12,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-01-07 21:42:12,595 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-01-07 21:42:12,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:12,595 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-01-07 21:42:12,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:42:12,595 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-01-07 21:42:12,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:42:12,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:12,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:42:12,595 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:12,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-01-07 21:42:12,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:12,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:12,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:12,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:12,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:12,810 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-07 21:42:12,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:12,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:12,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:42:12,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:42:12,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:12,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:42:12,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:42:12,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:42:12,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:42:12,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:42:12,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:12,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:42:12,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:42:12,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:42:12,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:42:12,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:42:12,854 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:12,882 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:12,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:12,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:12,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:12,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:12,937 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:42:12,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:12,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-07 21:42:12,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:13,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:13,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:42:13,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:42:13,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:13,112 INFO L267 ElimStorePlain]: Start 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-07 21:42:13,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:42:13,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,162 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:13,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-07 21:42:13,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:13,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:13,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:42:13,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,256 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:13,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:42:13,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:13,306 INFO L267 ElimStorePlain]: Start 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-07 21:42:13,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:13,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:13,350 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:13,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:42:13,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:13,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:13,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:13,430 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-07 21:42:13,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:13,507 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-07 21:42:13,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:13,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-07 21:42:13,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:13,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:42:13,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:42:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:42:13,527 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-01-07 21:42:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:14,965 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-01-07 21:42:14,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:42:14,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-07 21:42:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:14,966 INFO L225 Difference]: With dead ends: 75 [2019-01-07 21:42:14,966 INFO L226 Difference]: Without dead ends: 68 [2019-01-07 21:42:14,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:42:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-07 21:42:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-01-07 21:42:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-07 21:42:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-01-07 21:42:15,535 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-01-07 21:42:15,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:15,535 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-01-07 21:42:15,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:42:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-01-07 21:42:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:42:15,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:15,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:42:15,535 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-01-07 21:42:15,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:15,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:15,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:42:15,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:15,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:15,815 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-07 21:42:15,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:15,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:15,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:42:15,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:42:15,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:15,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:42:15,825 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:42:15,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:42:15,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:42:15,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:42:15,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:15,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:42:15,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:42:15,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:42:15,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:42:15,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:42:15,857 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:15,886 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:15,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:15,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:15,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:15,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:15,942 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:42:15,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:15,983 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-07 21:42:15,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,025 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-07 21:42:16,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:42:16,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-07 21:42:16,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,118 INFO L267 ElimStorePlain]: Start 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-07 21:42:16,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-07 21:42:16,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,164 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:16,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-07 21:42:16,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,219 INFO L267 ElimStorePlain]: Start 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-07 21:42:16,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-07 21:42:16,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,262 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:16,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:42:16,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,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-07 21:42:16,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:16,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:16,358 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:16,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:42:16,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:16,409 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-07 21:42:16,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:16,438 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-07 21:42:16,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:16,512 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-07 21:42:16,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:16,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-07 21:42:16,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:16,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:42:16,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:42:16,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:42:16,533 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-01-07 21:42:18,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:18,536 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-01-07 21:42:18,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 21:42:18,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-07 21:42:18,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:18,537 INFO L225 Difference]: With dead ends: 97 [2019-01-07 21:42:18,537 INFO L226 Difference]: Without dead ends: 84 [2019-01-07 21:42:18,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:42:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-07 21:42:19,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-01-07 21:42:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-07 21:42:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-01-07 21:42:19,391 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-01-07 21:42:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:19,391 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-01-07 21:42:19,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:42:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-01-07 21:42:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:42:19,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:42:19,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 21:42:19,392 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:42:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:42:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-01-07 21:42:19,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:42:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:19,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:42:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:42:19,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:42:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:19,685 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-07 21:42:19,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:19,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:42:19,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:42:19,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:42:19,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:42:19,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:42:19,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:42:19,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:42:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:42:19,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:42:19,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-07 21:42:19,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-07 21:42:19,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-07 21:42:19,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-07 21:42:19,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-07 21:42:19,735 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,763 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,818 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-07 21:42:19,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,859 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-07 21:42:19,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:19,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-07 21:42:19,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:19,953 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:19,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-07 21:42:19,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:19,996 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-07 21:42:19,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2019-01-07 21:42:20,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-07 21:42:20,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-07 21:42:20,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:20,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,175 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:20,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:42:20,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,227 INFO L267 ElimStorePlain]: Start 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-07 21:42:20,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:20,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 21:42:20,275 INFO L683 Elim1Store]: detected equality via solver [2019-01-07 21:42:20,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-07 21:42:20,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:42:20,325 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-07 21:42:20,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-07 21:42:20,354 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-07 21:42:20,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:42:20,440 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-07 21:42:20,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:42:20,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-07 21:42:20,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:42:20,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:42:20,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:42:20,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-07 21:42:20,459 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-01-07 21:42:22,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:42:22,112 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-01-07 21:42:22,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:42:22,113 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-07 21:42:22,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:42:22,113 INFO L225 Difference]: With dead ends: 67 [2019-01-07 21:42:22,113 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 21:42:22,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:42:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 21:42:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 21:42:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 21:42:22,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 21:42:22,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-07 21:42:22,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:42:22,115 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 21:42:22,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:42:22,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 21:42:22,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 21:42:22,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 21:42:22,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:22,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:22,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:22,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:23,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:23,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:23,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:23,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:23,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:23,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:23,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:23,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:24,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:25,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:25,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:25,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:25,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:25,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:26,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:26,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:30,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:30,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:31,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:36,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:36,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:36,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:37,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:37,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:41,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:42,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:42,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:42,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:42,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:42,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:42,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:42,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:43,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:43,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:43,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:43,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:43,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:45,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:56,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:57,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:57,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:57,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:57,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:42:57,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:02,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:15,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:22,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:22,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:23,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:23,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:30,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:30,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:30,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:30,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:30,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:30,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:38,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:38,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:42,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:42,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:42,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:42,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:42,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:42,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:43:48,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:44:28,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:44:40,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:44:41,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:44:41,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:44:57,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:44:57,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:44:57,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 21:45:01,606 WARN L181 SmtUtils]: Spent 2.66 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-01-07 21:48:57,620 WARN L181 SmtUtils]: Spent 3.93 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-01-07 21:48:57,624 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-07 21:48:57,624 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-01-07 21:48:57,624 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-07 21:48:57,624 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-07 21:48:57,624 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-01-07 21:48:57,624 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-07 21:48:57,625 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-07 21:48:57,625 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-07 21:48:57,625 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-01-07 21:48:57,625 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-01-07 21:48:57,625 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-01-07 21:48:57,625 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-01-07 21:48:57,625 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-01-07 21:48:57,645 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 09:48:57 BoogieIcfgContainer [2019-01-07 21:48:57,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 21:48:57,646 INFO L168 Benchmark]: Toolchain (without parser) took 718082.97 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 162.1 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2019-01-07 21:48:57,646 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:48:57,646 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:48:57,647 INFO L168 Benchmark]: Boogie Preprocessor took 30.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 21:48:57,647 INFO L168 Benchmark]: RCFGBuilder took 360.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 21:48:57,647 INFO L168 Benchmark]: TraceAbstraction took 717617.53 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 140.9 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. [2019-01-07 21:48:57,648 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.98 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.92 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 360.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 717617.53 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 140.9 MB). Peak memory consumption was 3.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 717.4s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 148.5s AutomataDifference, 0.0s DeadEndRemovalTime, 395.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 61.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 65.6s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 159.4s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 235.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 100.4s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...