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-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:04:41,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:04:41,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:04:41,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:04:41,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:04:41,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:04:41,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:04:41,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:04:41,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:04:41,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:04:41,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:04:41,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:04:41,624 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:04:41,625 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:04:41,626 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:04:41,628 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:04:41,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:04:41,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:04:41,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:04:41,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:04:41,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:04:41,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:04:41,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:04:41,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:04:41,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:04:41,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:04:41,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:04:41,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:04:41,657 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:04:41,658 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:04:41,658 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:04:41,660 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:04:41,661 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:04:41,661 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:04:41,663 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:04:41,663 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:04:41,664 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-08 14:04:41,687 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:04:41,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:04:41,688 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:04:41,688 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:04:41,688 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:04:41,688 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:04:41,689 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:04:41,689 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:04:41,689 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 14:04:41,689 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:04:41,689 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 14:04:41,689 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 14:04:41,690 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:04:41,690 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:04:41,690 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:04:41,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:04:41,691 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:04:41,691 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:04:41,691 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:04:41,691 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:04:41,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:04:41,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:04:41,692 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:04:41,692 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:04:41,692 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:04:41,693 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:04:41,693 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:04:41,693 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:04:41,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:04:41,693 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:04:41,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:04:41,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:04:41,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:04:41,694 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:04:41,694 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:04:41,695 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:04:41,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:04:41,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:04:41,695 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:04:41,695 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:04:41,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:04:41,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:04:41,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:04:41,743 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:04:41,744 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:04:41,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-01-08 14:04:41,745 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-01-08 14:04:41,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:04:41,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:04:41,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:41,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:04:41,792 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:04:41,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/1) ... [2019-01-08 14:04:41,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/1) ... [2019-01-08 14:04:41,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:04:41,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:04:41,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:04:41,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:04:41,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/1) ... [2019-01-08 14:04:41,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/1) ... [2019-01-08 14:04:41,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/1) ... [2019-01-08 14:04:41,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/1) ... [2019-01-08 14:04:41,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/1) ... [2019-01-08 14:04:41,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/1) ... [2019-01-08 14:04:41,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/1) ... [2019-01-08 14:04:41,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:04:41,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:04:41,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:04:41,874 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:04:41,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 14:04:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:04:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:04:42,413 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:04:42,414 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-08 14:04:42,415 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:04:42 BoogieIcfgContainer [2019-01-08 14:04:42,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:04:42,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:04:42,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:04:42,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:04:42,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:04:41" (1/2) ... [2019-01-08 14:04:42,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfbdf74 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:04:42, skipping insertion in model container [2019-01-08 14:04:42,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:04:42" (2/2) ... [2019-01-08 14:04:42,424 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-01-08 14:04:42,435 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:04:42,443 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-08 14:04:42,463 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-08 14:04:42,505 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:04:42,505 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:04:42,505 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:04:42,506 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:04:42,506 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:04:42,506 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:04:42,506 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:04:42,506 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:04:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-08 14:04:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-08 14:04:42,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:42,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-08 14:04:42,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:42,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:42,540 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-08 14:04:42,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:42,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:42,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:42,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:42,732 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-08 14:04:42,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:04:42,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-08 14:04:42,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:42,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:04:42,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:04:42,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:04:42,753 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-08 14:04:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:42,980 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-08 14:04:42,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:04:42,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-08 14:04:42,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:42,997 INFO L225 Difference]: With dead ends: 29 [2019-01-08 14:04:42,997 INFO L226 Difference]: Without dead ends: 24 [2019-01-08 14:04:43,001 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-08 14:04:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-08 14:04:43,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-08 14:04:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-08 14:04:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-08 14:04:43,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-08 14:04:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:43,036 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-08 14:04:43,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:04:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-08 14:04:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:43,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:43,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:43,038 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:43,038 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-08 14:04:43,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:43,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:43,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:43,182 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-08 14:04:43,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:43,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:43,184 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:43,187 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-08 14:04:43,226 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:43,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:43,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:43,312 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:43,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:43,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:43,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:43,320 INFO 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-08 14:04:43,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:43,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:43,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:43,692 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-08 14:04:43,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:04:43,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:43,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:04:43,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:04:43,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:04:43,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:04:43,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:43,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:04:43,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,072 INFO L303 Elim1Store]: Index analysis took 137 ms [2019-01-08 14:04:44,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:04:44,077 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,398 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,484 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:44,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:44,589 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-08 14:04:44,768 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-08 14:04:44,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:44,998 INFO L303 Elim1Store]: Index analysis took 213 ms [2019-01-08 14:04:45,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:04:45,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:45,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:45,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-08 14:04:45,242 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-08 14:04:45,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:45,265 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-08 14:04:45,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:45,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:45,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:45,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:45,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:45,287 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-08 14:04:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:47,096 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-08 14:04:47,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:47,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:04:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:47,099 INFO L225 Difference]: With dead ends: 47 [2019-01-08 14:04:47,099 INFO L226 Difference]: Without dead ends: 45 [2019-01-08 14:04:47,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:04:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-08 14:04:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-08 14:04:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-08 14:04:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-08 14:04:47,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-08 14:04:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:47,108 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-08 14:04:47,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-08 14:04:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:47,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:47,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:47,109 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:47,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:47,110 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-08 14:04:47,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:47,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:47,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:47,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:47,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:47,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:47,239 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:47,240 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-08 14:04:47,246 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:47,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:47,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:47,260 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:47,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:47,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:47,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:47,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:04:47,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:47,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:47,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:47,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:04:47,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,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 24 treesize of output 30 [2019-01-08 14:04:47,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:04:47,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:04:47,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:04:47,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:04:47,503 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,582 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,678 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,712 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:04:47,757 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:47,798 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:45, output treesize:46 [2019-01-08 14:04:47,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:47,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:04:47,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:47,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:47,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-08 14:04:47,990 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-08 14:04:47,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:47,994 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-08 14:04:48,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:04:48,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:04:48,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:04:48,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:04:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:04:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:04:48,014 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-08 14:04:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:48,075 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-08 14:04:48,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:04:48,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-08 14:04:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:48,078 INFO L225 Difference]: With dead ends: 23 [2019-01-08 14:04:48,078 INFO L226 Difference]: Without dead ends: 22 [2019-01-08 14:04:48,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:04:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-08 14:04:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-08 14:04:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-08 14:04:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-08 14:04:48,084 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-08 14:04:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:48,085 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-08 14:04:48,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:04:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-08 14:04:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:48,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:48,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:48,086 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:48,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-08 14:04:48,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:48,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:48,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:48,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:48,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:48,186 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-08 14:04:48,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:48,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:48,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:48,187 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-08 14:04:48,188 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:48,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:48,196 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:48,197 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:48,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:48,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:48,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:04:48,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:48,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:48,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:48,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:04:48,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:04:48,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:04:48,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:04:48,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:04:48,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:04:48,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:04:48,537 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,575 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,614 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:48,702 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-08 14:04:48,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:48,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:04:48,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:48,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:48,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-08 14:04:48,909 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-08 14:04:48,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:48,921 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-08 14:04:48,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:48,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:48,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:48,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:48,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:48,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:48,943 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-08 14:04:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:50,353 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-01-08 14:04:50,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:50,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:04:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:50,356 INFO L225 Difference]: With dead ends: 50 [2019-01-08 14:04:50,357 INFO L226 Difference]: Without dead ends: 47 [2019-01-08 14:04:50,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:04:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-08 14:04:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2019-01-08 14:04:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-08 14:04:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-01-08 14:04:50,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 3 [2019-01-08 14:04:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:50,366 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-01-08 14:04:50,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-01-08 14:04:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 14:04:50,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:50,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 14:04:50,367 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-08 14:04:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:50,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:50,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:50,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:50,446 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-08 14:04:50,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:50,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:50,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-08 14:04:50,447 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-08 14:04:50,448 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:50,448 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:50,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:50,458 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:04:50,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:50,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:50,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:50,459 INFO 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-08 14:04:50,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:50,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:50,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:50,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:04:50,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:04:50,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:04:50,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:04:50,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:04:50,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,690 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-08 14:04:50,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:04:50,692 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:04:50,924 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:50,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:50,949 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-08 14:04:50,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:50,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:51,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:04:51,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:51,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:51,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-08 14:04:51,219 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-08 14:04:51,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:51,241 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-08 14:04:51,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:51,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:04:51,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:51,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:04:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:04:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:04:51,262 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-01-08 14:04:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:52,312 INFO L93 Difference]: Finished difference Result 50 states and 108 transitions. [2019-01-08 14:04:52,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:04:52,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-08 14:04:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:52,314 INFO L225 Difference]: With dead ends: 50 [2019-01-08 14:04:52,315 INFO L226 Difference]: Without dead ends: 48 [2019-01-08 14:04:52,315 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-08 14:04:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-08 14:04:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-08 14:04:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 14:04:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2019-01-08 14:04:52,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 87 transitions. Word has length 3 [2019-01-08 14:04:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:52,325 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 87 transitions. [2019-01-08 14:04:52,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:04:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 87 transitions. [2019-01-08 14:04:52,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:52,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:52,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:52,327 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-08 14:04:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:52,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:52,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:52,451 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-08 14:04:52,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:52,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:52,452 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:52,453 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-08 14:04:52,454 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:52,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:52,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:52,462 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:52,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:52,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:52,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:52,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 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-08 14:04:52,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:52,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:52,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:52,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:04:52,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,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 24 treesize of output 30 [2019-01-08 14:04:52,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:04:52,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:04:52,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,779 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-01-08 14:04:52,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:04:52,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:52,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:04:52,798 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,845 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:04:52,952 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:52,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:52,979 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:04:53,202 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-08 14:04:53,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,320 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-01-08 14:04:53,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:04:53,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,399 INFO L267 ElimStorePlain]: Start 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-08 14:04:53,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:04:53,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:53,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-08 14:04:53,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:53,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:53,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-08 14:04:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:53,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:53,725 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-08 14:04:53,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:53,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:53,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:53,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:53,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:53,745 INFO L87 Difference]: Start difference. First operand 26 states and 87 transitions. Second operand 8 states. [2019-01-08 14:04:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:56,587 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2019-01-08 14:04:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:04:56,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:04:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:56,590 INFO L225 Difference]: With dead ends: 62 [2019-01-08 14:04:56,590 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 14:04:56,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:04:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 14:04:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-01-08 14:04:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 14:04:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2019-01-08 14:04:56,601 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 105 transitions. Word has length 4 [2019-01-08 14:04:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:56,602 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 105 transitions. [2019-01-08 14:04:56,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:04:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 105 transitions. [2019-01-08 14:04:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:04:56,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:56,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:04:56,603 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-08 14:04:56,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:56,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:56,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:56,741 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-08 14:04:56,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:56,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:56,742 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:04:56,742 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-08 14:04:56,743 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:04:56,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:04:56,757 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:04:56,757 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:04:56,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:56,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:04:56,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:56,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:04:56,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:56,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:56,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:56,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:04:56,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:04:56,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:04:56,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:04:56,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:04:56,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:04:56,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:56,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:04:56,934 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,973 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:56,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:57,069 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:04:57,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:04:57,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,192 INFO L267 ElimStorePlain]: Start 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-08 14:04:57,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:04:57,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:04:57,255 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:04:57,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-08 14:04:57,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:57,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:04:57,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:04:57,520 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-08 14:04:57,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:57,550 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-08 14:04:57,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:57,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:04:57,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:57,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:04:57,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:04:57,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:04:57,572 INFO L87 Difference]: Start difference. First operand 30 states and 105 transitions. Second operand 8 states. [2019-01-08 14:05:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:00,396 INFO L93 Difference]: Finished difference Result 60 states and 147 transitions. [2019-01-08 14:05:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:00,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:05:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:00,398 INFO L225 Difference]: With dead ends: 60 [2019-01-08 14:05:00,399 INFO L226 Difference]: Without dead ends: 56 [2019-01-08 14:05:00,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-08 14:05:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-01-08 14:05:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 14:05:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-08 14:05:00,409 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-08 14:05:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:00,409 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-08 14:05:00,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-08 14:05:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:05:00,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:00,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:05:00,410 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-08 14:05:00,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:00,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:00,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:00,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:00,525 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-08 14:05:00,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:00,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:00,525 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:05:00,526 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-08 14:05:00,527 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:00,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:00,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:00,534 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:05:00,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:00,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:00,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:00,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 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-08 14:05:00,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:00,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:00,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:00,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:05:00,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:05:00,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:05:00,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:05:00,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:05:00,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:05:00,679 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:05:00,809 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:00,832 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:05:00,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:05:00,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:00,944 INFO L267 ElimStorePlain]: Start 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-08 14:05:00,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:05:00,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:00,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:01,009 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:05:01,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-08 14:05:01,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:01,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:01,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:05:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:01,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:01,260 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-08 14:05:01,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:01,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:01,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:01,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:01,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:01,281 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-08 14:05:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:04,097 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-08 14:05:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:04,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:05:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:04,099 INFO L225 Difference]: With dead ends: 57 [2019-01-08 14:05:04,099 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:05:04,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:05:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:05:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-08 14:05:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 14:05:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-08 14:05:04,108 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-08 14:05:04,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:04,109 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-08 14:05:04,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:04,109 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-08 14:05:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:05:04,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:04,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:05:04,110 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:04,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:04,110 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-08 14:05:04,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:04,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:04,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:04,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:04,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:04,259 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-08 14:05:04,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:04,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:04,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:05:04,260 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-08 14:05:04,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:04,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:04,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:04,269 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:05:04,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:04,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:04,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:04,270 INFO 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-08 14:05:04,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:04,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:04,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:04,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:05:04,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:05:04,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:05:04,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,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 26 treesize of output 40 [2019-01-08 14:05:04,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:05:04,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:05:04,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:05:04,426 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,585 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,610 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:04,684 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:05:04,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:05:04,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:04,792 INFO L267 ElimStorePlain]: Start 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-08 14:05:04,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:05:04,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:04,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-08 14:05:04,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:05,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:05,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-08 14:05:05,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-08 14:05:05,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:05,182 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-08 14:05:05,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:05,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:05,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:05,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:05,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:05,203 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-08 14:05:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:07,249 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-08 14:05:07,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:05:07,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:05:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:07,254 INFO L225 Difference]: With dead ends: 57 [2019-01-08 14:05:07,254 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 14:05:07,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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-08 14:05:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 14:05:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-08 14:05:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 14:05:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-08 14:05:07,263 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-08 14:05:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:07,263 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-08 14:05:07,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-08 14:05:07,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:05:07,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:07,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:05:07,264 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-08 14:05:07,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:07,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:07,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:07,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:07,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:07,348 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-08 14:05:07,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:07,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:07,348 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:05:07,349 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-08 14:05:07,350 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:07,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:07,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:07,356 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:05:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:07,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:07,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:07,356 INFO 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-08 14:05:07,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:07,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:07,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:07,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:05:07,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:05:07,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:05:07,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:05:07,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:05:07,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:05:07,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:05:07,541 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,581 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:07,668 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-08 14:05:07,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:05:07,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,775 INFO L267 ElimStorePlain]: Start 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-08 14:05:07,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:05:07,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:07,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-08 14:05:07,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:07,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:07,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-08 14:05:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:05:07,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:08,016 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-08 14:05:08,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:08,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:05:08,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:08,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:08,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:08,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:05:08,036 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-08 14:05:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:09,681 INFO L93 Difference]: Finished difference Result 77 states and 200 transitions. [2019-01-08 14:05:09,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:05:09,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:05:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:09,685 INFO L225 Difference]: With dead ends: 77 [2019-01-08 14:05:09,685 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 14:05:09,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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-08 14:05:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 14:05:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2019-01-08 14:05:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 14:05:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 159 transitions. [2019-01-08 14:05:09,695 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 159 transitions. Word has length 4 [2019-01-08 14:05:09,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:09,695 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 159 transitions. [2019-01-08 14:05:09,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:09,695 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 159 transitions. [2019-01-08 14:05:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:05:09,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:09,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:05:09,696 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:09,697 INFO L82 PathProgramCache]: Analyzing trace with hash 930058, now seen corresponding path program 1 times [2019-01-08 14:05:09,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:09,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:09,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:09,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:09,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:09,779 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-08 14:05:09,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:09,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:09,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:05:09,780 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [27] [2019-01-08 14:05:09,781 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:09,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:09,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:09,787 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:05:09,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:09,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:09,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:09,788 INFO 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-08 14:05:09,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:09,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:09,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:09,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:05:09,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:05:09,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:05:09,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:05:09,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:05:09,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:09,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:05:09,920 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,960 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:09,981 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,015 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:05:10,059 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:10,082 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-08 14:05:10,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:05:10,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,200 INFO L267 ElimStorePlain]: Start 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-08 14:05:10,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:05:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:10,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-08 14:05:10,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:10,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:10,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-08 14:05:10,593 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-08 14:05:10,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:10,774 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-08 14:05:10,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:10,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-08 14:05:10,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:10,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:05:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:05:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:05:10,796 INFO L87 Difference]: Start difference. First operand 38 states and 159 transitions. Second operand 8 states. [2019-01-08 14:05:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:05:12,576 INFO L93 Difference]: Finished difference Result 82 states and 241 transitions. [2019-01-08 14:05:12,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:05:12,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:05:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:05:12,579 INFO L225 Difference]: With dead ends: 82 [2019-01-08 14:05:12,580 INFO L226 Difference]: Without dead ends: 79 [2019-01-08 14:05:12,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-08 14:05:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-08 14:05:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2019-01-08 14:05:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-08 14:05:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 209 transitions. [2019-01-08 14:05:12,593 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 209 transitions. Word has length 4 [2019-01-08 14:05:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:05:12,593 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 209 transitions. [2019-01-08 14:05:12,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:05:12,593 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 209 transitions. [2019-01-08 14:05:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:05:12,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:05:12,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:05:12,595 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:05:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-08 14:05:12,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:05:12,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:12,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:12,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:05:12,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:05:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:12,739 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-08 14:05:12,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:12,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:05:12,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:05:12,740 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-08 14:05:12,741 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:05:12,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:05:12,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:05:12,751 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:05:12,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:05:12,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:05:12,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:05:12,751 INFO 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-08 14:05:12,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:05:12,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:05:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:05:12,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:05:12,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-08 14:05:12,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:05: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 24 treesize of output 30 [2019-01-08 14:05:12,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-08 14:05:12,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-08 14:05:12,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-08 14:05:12,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:12,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 32 treesize of output 75 [2019-01-08 14:05:12,902 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,940 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,962 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:12,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:13,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:05:13,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:05:13,033 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-01-08 14:05:15,092 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-08 14:05:15,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:05:15,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:05:15,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-08 14:05:15,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-08 14:05:15,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:196 [2019-01-08 14:05:27,565 WARN L181 SmtUtils]: Spent 11.78 s on a formula simplification that was a NOOP. DAG size: 106 [2019-01-08 14:05:27,573 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-08 14:05:27,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:05:27,593 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-08 14:05:27,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:05:27,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:05:27,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:05:27,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:05:27,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:05:27,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:05:27,616 INFO L87 Difference]: Start difference. First operand 46 states and 209 transitions. Second operand 6 states. [2019-01-08 14:06:01,833 WARN L181 SmtUtils]: Spent 34.13 s on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-01-08 14:06:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:04,114 INFO L93 Difference]: Finished difference Result 59 states and 225 transitions. [2019-01-08 14:06:04,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:06:04,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:06:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:04,115 INFO L225 Difference]: With dead ends: 59 [2019-01-08 14:06:04,115 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 14:06:04,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 48.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:06:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 14:06:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2019-01-08 14:06:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-08 14:06:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 216 transitions. [2019-01-08 14:06:04,124 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 216 transitions. Word has length 4 [2019-01-08 14:06:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:04,125 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 216 transitions. [2019-01-08 14:06:04,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:06:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 216 transitions. [2019-01-08 14:06:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:06:04,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:04,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:06:04,126 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:04,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:04,127 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-08 14:06:04,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:04,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:04,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:04,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:04,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:04,603 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2019-01-08 14:06:04,625 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-08 14:06:04,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:04,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:04,626 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:06:04,626 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-08 14:06:04,628 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:04,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:04,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:04,632 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:06:04,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:04,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:04,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:04,633 INFO 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-08 14:06:04,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:04,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:04,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:04,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:06:04,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:06:04,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:06:04,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:06:04,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:06:04,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:04,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:06:04,782 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:04,824 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:04,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:04,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:04,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:04,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:04,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:06:04,923 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:04,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:04,948 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:06:05,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:06:05,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:05,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:06:05,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:05,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-08 14:06:05,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:05,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:05,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-08 14:06:05,469 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-08 14:06:05,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:05,500 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-08 14:06:05,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:05,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:06:05,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:05,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:06:05,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:06:05,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:05,521 INFO L87 Difference]: Start difference. First operand 48 states and 216 transitions. Second operand 8 states. [2019-01-08 14:06:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:07,774 INFO L93 Difference]: Finished difference Result 84 states and 281 transitions. [2019-01-08 14:06:07,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:06:07,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:06:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:07,776 INFO L225 Difference]: With dead ends: 84 [2019-01-08 14:06:07,776 INFO L226 Difference]: Without dead ends: 82 [2019-01-08 14:06:07,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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-08 14:06:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-08 14:06:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 52. [2019-01-08 14:06:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 14:06:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 244 transitions. [2019-01-08 14:06:07,787 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 244 transitions. Word has length 4 [2019-01-08 14:06:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:07,788 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 244 transitions. [2019-01-08 14:06:07,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:06:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 244 transitions. [2019-01-08 14:06:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:06:07,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:07,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:06:07,789 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-08 14:06:07,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:07,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:07,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:07,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:07,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:07,893 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-08 14:06:07,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:07,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:07,894 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:06:07,894 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-08 14:06:07,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:07,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:07,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:07,899 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:06:07,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:07,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:07,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:07,900 INFO 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-08 14:06:07,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:07,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:07,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:07,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:06:07,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:06:07,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:06:07,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:06:07,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:07,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:06:08,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:06:08,010 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,053 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:06:08,155 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:08,178 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:06:08,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:06:08,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,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-08 14:06:08,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:06:08,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:08,390 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:08,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-08 14:06:08,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:08,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:08,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:06:08,632 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-08 14:06:08,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:08,712 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-08 14:06:08,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:08,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:06:08,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:08,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:06:08,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:06:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:08,732 INFO L87 Difference]: Start difference. First operand 52 states and 244 transitions. Second operand 8 states. [2019-01-08 14:06:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:11,641 INFO L93 Difference]: Finished difference Result 85 states and 287 transitions. [2019-01-08 14:06:11,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:06:11,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:06:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:11,643 INFO L225 Difference]: With dead ends: 85 [2019-01-08 14:06:11,643 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 14:06:11,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:06:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 14:06:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 53. [2019-01-08 14:06:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 14:06:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 251 transitions. [2019-01-08 14:06:11,664 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 251 transitions. Word has length 4 [2019-01-08 14:06:11,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:11,664 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 251 transitions. [2019-01-08 14:06:11,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:06:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 251 transitions. [2019-01-08 14:06:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:06:11,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:11,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:06:11,666 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:11,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-08 14:06:11,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:11,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:11,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:11,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:11,804 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-08 14:06:11,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:11,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:11,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:06:11,805 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-08 14:06:11,807 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:11,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:11,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:11,819 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:06:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:11,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:11,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:11,823 INFO 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-08 14:06:11,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:11,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:11,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:11,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:06:11,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-08 14:06:11,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:11,999 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 26 treesize of output 32 [2019-01-08 14:06:12,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,110 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-08 14:06:12,111 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 28 treesize of output 42 [2019-01-08 14:06:12,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,260 INFO L303 Elim1Store]: Index analysis took 148 ms [2019-01-08 14:06:12,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-08 14:06:12,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,468 INFO L303 Elim1Store]: Index analysis took 205 ms [2019-01-08 14:06:12,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-08 14:06:12,470 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,606 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,650 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:12,686 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:34, output treesize:43 [2019-01-08 14:06:12,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:12,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 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-08 14:06:12,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:12,763 INFO L267 ElimStorePlain]: Start 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-08 14:06:12,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:12,781 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-08 14:06:12,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:12,785 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-08 14:06:12,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-08 14:06:12,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-08 14:06:12,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:06:12,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:06:12,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:06:12,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:06:12,804 INFO L87 Difference]: Start difference. First operand 53 states and 251 transitions. Second operand 4 states. [2019-01-08 14:06:12,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:12,875 INFO L93 Difference]: Finished difference Result 84 states and 422 transitions. [2019-01-08 14:06:12,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:06:12,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 14:06:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:12,877 INFO L225 Difference]: With dead ends: 84 [2019-01-08 14:06:12,877 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 14:06:12,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:06:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 14:06:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2019-01-08 14:06:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-08 14:06:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 416 transitions. [2019-01-08 14:06:12,901 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 416 transitions. Word has length 4 [2019-01-08 14:06:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:12,901 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 416 transitions. [2019-01-08 14:06:12,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:06:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 416 transitions. [2019-01-08 14:06:12,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:06:12,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:12,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:06:12,902 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:12,906 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-08 14:06:12,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:12,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:12,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:12,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:12,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:12,998 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-08 14:06:12,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:12,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:12,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:06:12,999 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-08 14:06:13,000 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:13,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:13,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:13,005 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:06:13,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:13,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:13,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:13,005 INFO 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-08 14:06:13,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:13,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:13,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:13,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:06:13,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:13,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:06:13,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:06:13,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:06:13,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:06:13,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:06:13,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:06:13,173 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:13,327 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:13,348 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:13,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:13,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:13,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:13,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:13,417 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:06:13,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:06:13,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:13,591 INFO L267 ElimStorePlain]: Start 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-08 14:06:13,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:06:13,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:13,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-08 14:06:13,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:13,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:13,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-08 14:06:13,970 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-08 14:06:13,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:13,994 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-08 14:06:14,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:14,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:06:14,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:14,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:06:14,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:06:14,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:14,015 INFO L87 Difference]: Start difference. First operand 76 states and 416 transitions. Second operand 8 states. [2019-01-08 14:06:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:16,179 INFO L93 Difference]: Finished difference Result 114 states and 499 transitions. [2019-01-08 14:06:16,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:06:16,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-08 14:06:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:16,182 INFO L225 Difference]: With dead ends: 114 [2019-01-08 14:06:16,182 INFO L226 Difference]: Without dead ends: 112 [2019-01-08 14:06:16,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:06:16,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-08 14:06:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2019-01-08 14:06:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 14:06:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 460 transitions. [2019-01-08 14:06:16,200 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 460 transitions. Word has length 4 [2019-01-08 14:06:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:16,200 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 460 transitions. [2019-01-08 14:06:16,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:06:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 460 transitions. [2019-01-08 14:06:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:06:16,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:16,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:06:16,202 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:16,202 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-08 14:06:16,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:16,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:16,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:16,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:16,496 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-08 14:06:16,560 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-08 14:06:16,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:16,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:16,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 14:06:16,561 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-08 14:06:16,561 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:16,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:16,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:16,565 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:06:16,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:16,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:16,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:16,566 INFO 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-08 14:06:16,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:16,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:16,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:16,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:06:16,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-08 14:06:16,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-08 14:06:16,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,793 INFO L303 Elim1Store]: Index analysis took 125 ms [2019-01-08 14:06:16,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-08 14:06:16,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-08 14:06:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-08 14:06:16,837 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,869 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,889 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,919 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:16,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-08 14:06:16,955 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:34, output treesize:43 [2019-01-08 14:06:16,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:16,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-08 14:06:16,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:17,043 INFO L267 ElimStorePlain]: Start 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-08 14:06:17,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:06:17,186 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-08 14:06:17,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:17,198 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-08 14:06:17,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:17,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-08 14:06:17,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:17,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:06:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:06:17,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:06:17,220 INFO L87 Difference]: Start difference. First operand 84 states and 460 transitions. Second operand 6 states. [2019-01-08 14:06:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:17,487 INFO L93 Difference]: Finished difference Result 103 states and 478 transitions. [2019-01-08 14:06:17,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:06:17,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-08 14:06:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:17,490 INFO L225 Difference]: With dead ends: 103 [2019-01-08 14:06:17,490 INFO L226 Difference]: Without dead ends: 102 [2019-01-08 14:06:17,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-08 14:06:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-08 14:06:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2019-01-08 14:06:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 14:06:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 460 transitions. [2019-01-08 14:06:17,505 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 460 transitions. Word has length 4 [2019-01-08 14:06:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:17,505 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 460 transitions. [2019-01-08 14:06:17,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:06:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 460 transitions. [2019-01-08 14:06:17,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:06:17,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:17,507 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:06:17,507 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:17,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:17,508 INFO L82 PathProgramCache]: Analyzing trace with hash 29171926, now seen corresponding path program 1 times [2019-01-08 14:06:17,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:17,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:17,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:17,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:17,849 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-08 14:06:17,893 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-08 14:06:17,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:17,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:17,893 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:06:17,894 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-08 14:06:17,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:17,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:17,899 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:17,899 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:06:17,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:17,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:17,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:17,900 INFO 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-08 14:06:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:17,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:17,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:18,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:06:18,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,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 24 treesize of output 30 [2019-01-08 14:06:18,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:06:18,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:06:18,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:06:18,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:06:18,054 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,106 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:06:18,222 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:18,251 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:06:18,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:06:18,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:18,379 INFO L267 ElimStorePlain]: Start 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-08 14:06:18,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:06:18,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:18,864 INFO L303 Elim1Store]: Index analysis took 447 ms [2019-01-08 14:06:18,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-08 14:06:18,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:19,607 INFO L267 ElimStorePlain]: Start 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-08 14:06:19,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-08 14:06:19,808 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-08 14:06:19,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:19,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:19,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:19,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:19,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:19,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:19,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:19,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,055 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:20,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:20,057 INFO L303 Elim1Store]: Index analysis took 245 ms [2019-01-08 14:06:20,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-08 14:06:20,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:20,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:20,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:06:20,233 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-08 14:06:20,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:20,272 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-08 14:06:20,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:20,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:06:20,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:20,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:06:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:06:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:06:20,293 INFO L87 Difference]: Start difference. First operand 84 states and 460 transitions. Second operand 10 states. [2019-01-08 14:06:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:06:23,038 INFO L93 Difference]: Finished difference Result 154 states and 699 transitions. [2019-01-08 14:06:23,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:06:23,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:06:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:06:23,042 INFO L225 Difference]: With dead ends: 154 [2019-01-08 14:06:23,042 INFO L226 Difference]: Without dead ends: 151 [2019-01-08 14:06:23,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:06:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-08 14:06:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 96. [2019-01-08 14:06:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-08 14:06:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 529 transitions. [2019-01-08 14:06:23,060 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 529 transitions. Word has length 5 [2019-01-08 14:06:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:06:23,061 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 529 transitions. [2019-01-08 14:06:23,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:06:23,061 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 529 transitions. [2019-01-08 14:06:23,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:06:23,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:06:23,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:06:23,062 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:06:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:23,062 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-08 14:06:23,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:06:23,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:23,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:23,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:06:23,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:06:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:23,156 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-08 14:06:23,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:23,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:06:23,157 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:06:23,157 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-08 14:06:23,158 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:06:23,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:06:23,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:06:23,162 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:06:23,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:06:23,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:06:23,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:06:23,163 INFO 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-08 14:06:23,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:06:23,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:06:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:06:23,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:06:23,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:06:23,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:06:23,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-08 14:06:23,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-08 14:06:23,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-08 14:06:23,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-08 14:06:23,348 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,382 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,416 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-08 14:06:23,488 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:23,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:06:23,513 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:47 [2019-01-08 14:06:23,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 79 [2019-01-08 14:06:23,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-08 14:06:23,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-08 14:06:23,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:88 [2019-01-08 14:06:23,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:23,952 INFO L303 Elim1Store]: Index analysis took 115 ms [2019-01-08 14:06:24,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 117 [2019-01-08 14:06:24,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-08 14:06:24,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:06:24,396 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:06:24,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 84 [2019-01-08 14:06:24,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:06:24,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-08 14:06:24,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:110, output treesize:204 [2019-01-08 14:06:35,840 WARN L181 SmtUtils]: Spent 11.09 s on a formula simplification that was a NOOP. DAG size: 110 [2019-01-08 14:06:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:06:35,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:06:35,930 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-08 14:06:35,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:06:35,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:06:35,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:06:35,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:06:35,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:06:35,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:06:35,951 INFO L87 Difference]: Start difference. First operand 96 states and 529 transitions. Second operand 8 states. [2019-01-08 14:06:55,140 WARN L181 SmtUtils]: Spent 15.45 s on a formula simplification. DAG size of input: 120 DAG size of output: 115 [2019-01-08 14:07:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:01,635 INFO L93 Difference]: Finished difference Result 117 states and 575 transitions. [2019-01-08 14:07:01,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:07:01,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:07:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:01,637 INFO L225 Difference]: With dead ends: 117 [2019-01-08 14:07:01,637 INFO L226 Difference]: Without dead ends: 116 [2019-01-08 14:07:01,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=64, Invalid=91, Unknown=1, NotChecked=0, Total=156 [2019-01-08 14:07:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-08 14:07:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2019-01-08 14:07:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-08 14:07:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 556 transitions. [2019-01-08 14:07:01,651 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 556 transitions. Word has length 5 [2019-01-08 14:07:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:01,651 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 556 transitions. [2019-01-08 14:07:01,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:07:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 556 transitions. [2019-01-08 14:07:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:07:01,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:01,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:07:01,653 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:01,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:01,653 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-08 14:07:01,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:01,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:01,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:01,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:01,805 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-08 14:07:01,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:01,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:01,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:07:01,806 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-08 14:07:01,809 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:01,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:01,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:01,813 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:07:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:01,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:01,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:01,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 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-08 14:07:01,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:01,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:01,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:01,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:07:01,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:01,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:07:01,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:07:01,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:07:01,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:07:01,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:07:01,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:01,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:07:01,949 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:01,988 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,011 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:02,081 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-08 14:07:02,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:07:02,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,217 INFO L267 ElimStorePlain]: Start 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-08 14:07:02,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-08 14:07:02,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-08 14:07:02,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,334 INFO L267 ElimStorePlain]: Start 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-08 14:07:02,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-08 14:07:02,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,401 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:02,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:02,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-08 14:07:02,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:02,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:02,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:07:02,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-08 14:07:02,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:02,763 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-08 14:07:02,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:02,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:07:02,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:02,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:07:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:07:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:07:02,784 INFO L87 Difference]: Start difference. First operand 100 states and 556 transitions. Second operand 10 states. [2019-01-08 14:07:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:06,514 INFO L93 Difference]: Finished difference Result 136 states and 615 transitions. [2019-01-08 14:07:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:07:06,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:07:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:06,517 INFO L225 Difference]: With dead ends: 136 [2019-01-08 14:07:06,518 INFO L226 Difference]: Without dead ends: 134 [2019-01-08 14:07:06,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:07:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-08 14:07:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2019-01-08 14:07:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-08 14:07:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 521 transitions. [2019-01-08 14:07:06,537 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 521 transitions. Word has length 5 [2019-01-08 14:07:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:06,537 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 521 transitions. [2019-01-08 14:07:06,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:07:06,537 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 521 transitions. [2019-01-08 14:07:06,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:07:06,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:06,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:07:06,538 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:06,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:06,539 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-08 14:07:06,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:06,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:06,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:06,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:06,685 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-08 14:07:06,975 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-08 14:07:06,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-08 14:07:06,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:06,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:06,982 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:07:06,982 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-08 14:07:06,983 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:06,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:06,986 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:06,986 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:07:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:06,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:06,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:06,987 INFO 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-08 14:07:06,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:06,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:07,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:07,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:07:07,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:07:07,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:07:07,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:07:07,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:07:07,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07: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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:07:07,077 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,120 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:07:07,215 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:07,239 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-08 14:07:07,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:07:07,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,368 INFO L267 ElimStorePlain]: Start 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-08 14:07:07,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-08 14:07:07,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:07,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-08 14:07:07,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,481 INFO L267 ElimStorePlain]: Start 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-08 14:07:07,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-08 14:07:07,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:07,570 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:07,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-01-08 14:07:07,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:07,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:07,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:60, output treesize:48 [2019-01-08 14:07:07,878 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-08 14:07:07,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:07,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:07,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:07:07,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:07,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:07:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:07:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:07:07,942 INFO L87 Difference]: Start difference. First operand 95 states and 521 transitions. Second operand 10 states. [2019-01-08 14:07:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:12,405 INFO L93 Difference]: Finished difference Result 128 states and 575 transitions. [2019-01-08 14:07:12,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:07:12,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:07:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:12,410 INFO L225 Difference]: With dead ends: 128 [2019-01-08 14:07:12,410 INFO L226 Difference]: Without dead ends: 127 [2019-01-08 14:07:12,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:07:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-08 14:07:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2019-01-08 14:07:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-08 14:07:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 521 transitions. [2019-01-08 14:07:12,430 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 521 transitions. Word has length 5 [2019-01-08 14:07:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:12,430 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 521 transitions. [2019-01-08 14:07:12,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:07:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 521 transitions. [2019-01-08 14:07:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:07:12,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:12,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:07:12,432 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:12,432 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-08 14:07:12,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:12,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:12,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:12,557 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-08 14:07:12,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:12,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:12,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:07:12,558 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-08 14:07:12,562 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:12,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:12,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:12,565 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:07:12,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:12,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:12,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:12,566 INFO 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-08 14:07:12,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:12,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:12,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:12,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:07:12,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:12,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:07:12,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:07:12,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:07:12,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:07:12,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:07:12,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:07:12,689 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:12,731 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:12,755 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:12,773 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:12,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:12,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:12,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:12,825 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:07:12,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:07:12,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:12,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:12,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:07:12,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:12,982 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:12,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-08 14:07:12,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:13,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:07:13,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:13,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-08 14:07:13,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:13,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:13,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:60, output treesize:50 [2019-01-08 14:07:13,347 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-08 14:07:13,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:13,371 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-08 14:07:13,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:13,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:07:13,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:13,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:07:13,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:07:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:07:13,391 INFO L87 Difference]: Start difference. First operand 95 states and 521 transitions. Second operand 10 states. [2019-01-08 14:07:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:15,611 INFO L93 Difference]: Finished difference Result 146 states and 698 transitions. [2019-01-08 14:07:15,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:07:15,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:07:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:15,616 INFO L225 Difference]: With dead ends: 146 [2019-01-08 14:07:15,616 INFO L226 Difference]: Without dead ends: 145 [2019-01-08 14:07:15,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:07:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-08 14:07:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 109. [2019-01-08 14:07:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-08 14:07:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 619 transitions. [2019-01-08 14:07:15,640 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 619 transitions. Word has length 5 [2019-01-08 14:07:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:15,641 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 619 transitions. [2019-01-08 14:07:15,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:07:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 619 transitions. [2019-01-08 14:07:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:07:15,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:15,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:07:15,642 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-08 14:07:15,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:15,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:15,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:15,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:15,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:15,793 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-08 14:07:15,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:15,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:15,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:07:15,794 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-08 14:07:15,795 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:15,795 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:15,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:15,799 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:07:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:15,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:15,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:15,800 INFO 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-08 14:07:15,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:15,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:15,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:15,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:07:15,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:07:15,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:07:15,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:07:15,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:07:15,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:07:15,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:15,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:07:15,944 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:15,985 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,025 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,052 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:16,076 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-08 14:07:16,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:07:16,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,188 INFO L267 ElimStorePlain]: Start 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-08 14:07:16,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-08 14:07:16,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-08 14:07:16,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,313 INFO L267 ElimStorePlain]: Start 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-08 14:07:16,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-08 14:07:16,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,383 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:16,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:16,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-08 14:07:16,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:16,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:16,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:07:16,682 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-08 14:07:16,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:16,743 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-08 14:07:16,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:16,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:07:16,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:16,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:07:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:07:16,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:07:16,764 INFO L87 Difference]: Start difference. First operand 109 states and 619 transitions. Second operand 10 states. [2019-01-08 14:07:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:20,206 INFO L93 Difference]: Finished difference Result 147 states and 692 transitions. [2019-01-08 14:07:20,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:07:20,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:07:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:20,208 INFO L225 Difference]: With dead ends: 147 [2019-01-08 14:07:20,209 INFO L226 Difference]: Without dead ends: 145 [2019-01-08 14:07:20,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:07:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-08 14:07:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 104. [2019-01-08 14:07:20,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-08 14:07:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 584 transitions. [2019-01-08 14:07:20,227 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 584 transitions. Word has length 5 [2019-01-08 14:07:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:20,228 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 584 transitions. [2019-01-08 14:07:20,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:07:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 584 transitions. [2019-01-08 14:07:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:07:20,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:20,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:07:20,229 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:20,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:20,229 INFO L82 PathProgramCache]: Analyzing trace with hash 28825532, now seen corresponding path program 2 times [2019-01-08 14:07:20,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:20,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:20,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:20,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:20,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:20,378 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-08 14:07:20,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:20,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:20,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:07:20,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:07:20,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:20,379 INFO 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-08 14:07:20,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:07:20,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:07:20,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:07:20,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:07:20,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07: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 21 treesize of output 24 [2019-01-08 14:07:20,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:07:20,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:07:20,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:07:20,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:07:20,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:07:20,494 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:20,533 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:20,555 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:20,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:20,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:20,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:20,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:07:20,624 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:20,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:20,646 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:07:20,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:07:20,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:20,773 INFO L267 ElimStorePlain]: Start 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-08 14:07:20,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-08 14:07:20,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-08 14:07:20,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:20,883 INFO L267 ElimStorePlain]: Start 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-08 14:07:20,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:07:20,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,937 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:20,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:20,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-08 14:07:20,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:21,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:21,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:07:21,167 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-08 14:07:21,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:07:21,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:21,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:07:21,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:21,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:07:21,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:07:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:07:21,223 INFO L87 Difference]: Start difference. First operand 104 states and 584 transitions. Second operand 10 states. [2019-01-08 14:07:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:24,490 INFO L93 Difference]: Finished difference Result 162 states and 738 transitions. [2019-01-08 14:07:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:07:24,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:07:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:24,493 INFO L225 Difference]: With dead ends: 162 [2019-01-08 14:07:24,493 INFO L226 Difference]: Without dead ends: 161 [2019-01-08 14:07:24,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:07:24,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-08 14:07:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2019-01-08 14:07:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-08 14:07:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 626 transitions. [2019-01-08 14:07:24,518 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 626 transitions. Word has length 5 [2019-01-08 14:07:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:24,518 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 626 transitions. [2019-01-08 14:07:24,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:07:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 626 transitions. [2019-01-08 14:07:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:07:24,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:24,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:07:24,519 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-08 14:07:24,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:24,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:07:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:24,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:24,641 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-08 14:07:24,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:24,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:24,641 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:07:24,641 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-08 14:07:24,642 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:24,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:24,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:24,645 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:07:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:24,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:24,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:24,645 INFO 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-08 14:07:24,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:24,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:24,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:24,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-08 14:07:24,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:24,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:07:24,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:07:24,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-08 14:07:24,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-08 14:07:24,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-08 14:07:24,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:24,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-08 14:07:24,751 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:24,783 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:24,802 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:24,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:24,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:25,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:25,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:25,136 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:47 [2019-01-08 14:07:25,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:25,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:07:25,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-08 14:07:25,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-08 14:07:25,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:196 [2019-01-08 14:07:27,643 WARN L181 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 105 [2019-01-08 14:07:27,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:27,929 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:27,930 INFO L303 Elim1Store]: Index analysis took 280 ms [2019-01-08 14:07:27,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 84 [2019-01-08 14:07:27,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:28,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 90 [2019-01-08 14:07:28,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:28,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,329 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:28,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-08 14:07:28,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:28,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,519 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:28,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-08 14:07:28,521 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:28,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:28,701 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:28,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 117 [2019-01-08 14:07:28,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:28,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 5 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-08 14:07:28,853 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 26 variables, input treesize:246, output treesize:200 [2019-01-08 14:07:29,622 WARN L181 SmtUtils]: Spent 637.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-08 14:07:29,627 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-08 14:07:29,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:29,656 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-08 14:07:29,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:29,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:07:29,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:29,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:07:29,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:07:29,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:07:29,675 INFO L87 Difference]: Start difference. First operand 110 states and 626 transitions. Second operand 8 states. [2019-01-08 14:07:31,221 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-01-08 14:07:34,854 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-01-08 14:07:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:41,670 INFO L93 Difference]: Finished difference Result 145 states and 689 transitions. [2019-01-08 14:07:41,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:07:41,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:07:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:41,673 INFO L225 Difference]: With dead ends: 145 [2019-01-08 14:07:41,673 INFO L226 Difference]: Without dead ends: 141 [2019-01-08 14:07:41,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:07:41,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-08 14:07:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2019-01-08 14:07:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-08 14:07:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 651 transitions. [2019-01-08 14:07:41,692 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 651 transitions. Word has length 5 [2019-01-08 14:07:41,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:41,692 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 651 transitions. [2019-01-08 14:07:41,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:07:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 651 transitions. [2019-01-08 14:07:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:07:41,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:41,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:07:41,693 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-08 14:07:41,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:41,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:41,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:41,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:41,980 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-08 14:07:42,003 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-08 14:07:42,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:42,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:42,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:07:42,004 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-08 14:07:42,005 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:42,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:42,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:42,008 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:07:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:42,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:42,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:42,009 INFO 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-08 14:07:42,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:42,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:42,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:42,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:07:42,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:07:42,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-08 14:07:42,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-08 14:07:42,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-08 14:07:42,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-08 14:07:42,088 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:42,118 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:42,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:42,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:42,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:42,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:42,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-08 14:07:42,200 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:42,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:42,221 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:47 [2019-01-08 14:07:42,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:07:42,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-08 14:07:42,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-08 14:07:42,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:196 [2019-01-08 14:07:42,720 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-08 14:07:42,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 90 [2019-01-08 14:07:42,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:42,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:42,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 123 [2019-01-08 14:07:42,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:43,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,138 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:07:43,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 84 [2019-01-08 14:07:43,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:43,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 98 [2019-01-08 14:07:43,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:43,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:43,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 98 [2019-01-08 14:07:43,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:43,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 5 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-08 14:07:43,642 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 26 variables, input treesize:246, output treesize:196 [2019-01-08 14:07:46,213 WARN L181 SmtUtils]: Spent 493.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-01-08 14:07:46,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-08 14:07:46,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:07:46,318 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-08 14:07:46,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:07:46,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:07:46,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:07:46,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:07:46,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:07:46,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=64, Unknown=1, NotChecked=0, Total=110 [2019-01-08 14:07:46,338 INFO L87 Difference]: Start difference. First operand 116 states and 651 transitions. Second operand 8 states. [2019-01-08 14:07:46,744 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 100 [2019-01-08 14:07:51,183 WARN L181 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-01-08 14:07:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:55,713 INFO L93 Difference]: Finished difference Result 144 states and 719 transitions. [2019-01-08 14:07:55,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:07:55,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:07:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:55,715 INFO L225 Difference]: With dead ends: 144 [2019-01-08 14:07:55,715 INFO L226 Difference]: Without dead ends: 143 [2019-01-08 14:07:55,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=64, Invalid=91, Unknown=1, NotChecked=0, Total=156 [2019-01-08 14:07:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-08 14:07:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2019-01-08 14:07:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-08 14:07:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 700 transitions. [2019-01-08 14:07:55,736 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 700 transitions. Word has length 5 [2019-01-08 14:07:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:55,737 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 700 transitions. [2019-01-08 14:07:55,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:07:55,737 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 700 transitions. [2019-01-08 14:07:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:07:55,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:55,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:07:55,738 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:55,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:55,738 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-08 14:07:55,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:55,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:55,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:55,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:55,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:07:55,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:07:55,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:07:55,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:07:55,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:07:55,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:07:55,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:07:55,789 INFO L87 Difference]: Start difference. First operand 123 states and 700 transitions. Second operand 4 states. [2019-01-08 14:07:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:07:55,899 INFO L93 Difference]: Finished difference Result 132 states and 708 transitions. [2019-01-08 14:07:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:07:55,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 14:07:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:07:55,901 INFO L225 Difference]: With dead ends: 132 [2019-01-08 14:07:55,902 INFO L226 Difference]: Without dead ends: 129 [2019-01-08 14:07:55,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-08 14:07:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-08 14:07:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2019-01-08 14:07:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-08 14:07:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 697 transitions. [2019-01-08 14:07:55,921 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 697 transitions. Word has length 5 [2019-01-08 14:07:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:07:55,921 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 697 transitions. [2019-01-08 14:07:55,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:07:55,922 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 697 transitions. [2019-01-08 14:07:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:07:55,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:07:55,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:07:55,922 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:07:55,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-08 14:07:55,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:07:55,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:55,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:55,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:07:55,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:07:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:56,058 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-08 14:07:56,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:56,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:07:56,059 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:07:56,059 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-08 14:07:56,060 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:07:56,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:07:56,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:07:56,064 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:07:56,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:07:56,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:07:56,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:07:56,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:07:56,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:07:56,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:07:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:07:56,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:07:56,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:07:56,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:07:56,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-08 14:07:56,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-08 14:07:56,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-08 14:07:56,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-08 14:07:56,282 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:56,311 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:56,327 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:56,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:56,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:56,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:07:56,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-08 14:07:56,392 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:07:56,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:07:56,414 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:42, output treesize:47 [2019-01-08 14:07:56,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:07:56,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-08 14:07:56,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-08 14:07:56,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-08 14:07:56,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:196 [2019-01-08 14:08:02,027 WARN L181 SmtUtils]: Spent 5.27 s on a formula simplification that was a NOOP. DAG size: 91 [2019-01-08 14:08:02,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 90 [2019-01-08 14:08:02,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:02,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,278 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:02,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-08 14:08:02,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:02,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,471 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:02,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 109 [2019-01-08 14:08:02,472 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:02,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,657 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:02,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-08 14:08:02,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:02,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:08:02,831 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:08:02,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 92 [2019-01-08 14:08:02,833 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-08 14:08:02,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 21 dim-0 vars, 5 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-08 14:08:02,976 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 26 variables, input treesize:246, output treesize:200 [2019-01-08 14:08:11,954 WARN L181 SmtUtils]: Spent 8.81 s on a formula simplification that was a NOOP. DAG size: 108 [2019-01-08 14:08:11,959 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-08 14:08:11,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:08:11,984 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-08 14:08:12,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:08:12,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:08:12,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:08:12,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:08:12,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:08:12,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:08:12,004 INFO L87 Difference]: Start difference. First operand 121 states and 697 transitions. Second operand 8 states. [2019-01-08 14:08:31,991 WARN L181 SmtUtils]: Spent 19.82 s on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-01-08 14:08:56,661 WARN L181 SmtUtils]: Spent 19.74 s on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2019-01-08 14:09:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:04,916 INFO L93 Difference]: Finished difference Result 157 states and 755 transitions. [2019-01-08 14:09:04,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:09:04,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:09:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:04,918 INFO L225 Difference]: With dead ends: 157 [2019-01-08 14:09:04,919 INFO L226 Difference]: Without dead ends: 155 [2019-01-08 14:09:04,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:09:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-08 14:09:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 123. [2019-01-08 14:09:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-08 14:09:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 711 transitions. [2019-01-08 14:09:04,950 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 711 transitions. Word has length 5 [2019-01-08 14:09:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:04,951 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 711 transitions. [2019-01-08 14:09:04,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:09:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 711 transitions. [2019-01-08 14:09:04,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:04,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:04,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:04,952 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:04,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash 29302622, now seen corresponding path program 1 times [2019-01-08 14:09:04,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:04,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:04,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:04,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:04,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:05,327 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2019-01-08 14:09:05,389 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-08 14:09:05,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:05,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:05,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:05,389 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-08 14:09:05,390 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:05,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:05,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:05,393 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:05,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:05,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:05,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:09:05,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:05,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:05,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:05,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:05,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:09:05,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:09:05,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:09:05,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:09:05,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:09:05,489 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:05,527 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:05,549 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:05,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:05,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:05,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:05,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:09:05,618 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:05,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:05,641 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-08 14:09:05,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:09:05,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:05,741 INFO L267 ElimStorePlain]: Start 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-08 14:09:05,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:05,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-08 14:09:05,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:05,892 INFO L267 ElimStorePlain]: Start 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-08 14:09:05,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:05,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,955 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:05,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:05,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-08 14:09:05,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:06,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:06,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:09:06,254 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-08 14:09:06,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:06,291 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-08 14:09:06,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:06,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:09:06,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:06,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:09:06,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:09:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:09:06,311 INFO L87 Difference]: Start difference. First operand 123 states and 711 transitions. Second operand 10 states. [2019-01-08 14:09:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:10,286 INFO L93 Difference]: Finished difference Result 169 states and 820 transitions. [2019-01-08 14:09:10,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:09:10,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:09:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:10,288 INFO L225 Difference]: With dead ends: 169 [2019-01-08 14:09:10,288 INFO L226 Difference]: Without dead ends: 162 [2019-01-08 14:09:10,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:09:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-08 14:09:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2019-01-08 14:09:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-08 14:09:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 779 transitions. [2019-01-08 14:09:10,325 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 779 transitions. Word has length 5 [2019-01-08 14:09:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:10,325 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 779 transitions. [2019-01-08 14:09:10,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 779 transitions. [2019-01-08 14:09:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:10,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:10,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:10,326 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-08 14:09:10,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:10,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:10,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:10,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:10,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:10,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:10,459 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:10,459 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-08 14:09:10,460 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:10,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:10,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:10,463 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:10,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:10,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:10,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:10,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 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-08 14:09:10,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:10,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:10,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:10,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 21 treesize of output 24 [2019-01-08 14:09:10,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-08 14:09:10,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-08 14:09:10,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,509 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 28 treesize of output 42 [2019-01-08 14:09:10,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-08 14:09:10,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-08 14:09:10,534 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:10,562 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:10,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:10,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:10,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:10,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:10,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:10,634 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:34, output treesize:43 [2019-01-08 14:09:10,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,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, 11 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-08 14:09:10,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:10,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:10,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:10,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:10,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-08 14:09:10,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:10,803 INFO L267 ElimStorePlain]: Start 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-08 14:09:10,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:10,830 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-08 14:09:10,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:10,851 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-08 14:09:10,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:09:10,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:10,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:09:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:09:10,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:09:10,871 INFO L87 Difference]: Start difference. First operand 132 states and 779 transitions. Second operand 8 states. [2019-01-08 14:09:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:11,325 INFO L93 Difference]: Finished difference Result 150 states and 794 transitions. [2019-01-08 14:09:11,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:09:11,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:09:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:11,327 INFO L225 Difference]: With dead ends: 150 [2019-01-08 14:09:11,327 INFO L226 Difference]: Without dead ends: 149 [2019-01-08 14:09:11,327 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-08 14:09:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-08 14:09:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2019-01-08 14:09:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-08 14:09:11,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 777 transitions. [2019-01-08 14:09:11,351 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 777 transitions. Word has length 5 [2019-01-08 14:09:11,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:11,352 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 777 transitions. [2019-01-08 14:09:11,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:09:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 777 transitions. [2019-01-08 14:09:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:11,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:11,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:11,353 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:11,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:11,353 INFO L82 PathProgramCache]: Analyzing trace with hash 29302312, now seen corresponding path program 1 times [2019-01-08 14:09:11,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:11,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:11,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:11,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:11,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:11,504 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-08 14:09:11,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:11,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:11,504 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:11,504 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [27] [2019-01-08 14:09:11,505 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:11,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:11,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:11,509 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:11,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:11,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:11,510 INFO 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-08 14:09:11,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:11,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:11,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:11,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:11,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:09:11,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:09:11,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:09:11,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:09:11,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:09:11,597 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:11,636 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:11,658 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:11,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:11,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:11,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:11,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:09:11,726 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:11,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:11,747 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-08 14:09:11,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:09:11,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:11,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-08 14:09:11,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:11,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:11,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-08 14:09:11,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:11,976 INFO L267 ElimStorePlain]: Start 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-08 14:09:11,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:12,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:12,024 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:12,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-08 14:09:12,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:12,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:12,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-08 14:09:12,326 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-08 14:09:12,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:12,365 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-08 14:09:12,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:12,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:09:12,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:12,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:09:12,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:09:12,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:09:12,384 INFO L87 Difference]: Start difference. First operand 131 states and 777 transitions. Second operand 10 states. [2019-01-08 14:09:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:15,159 INFO L93 Difference]: Finished difference Result 172 states and 877 transitions. [2019-01-08 14:09:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:09:15,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:09:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:15,162 INFO L225 Difference]: With dead ends: 172 [2019-01-08 14:09:15,162 INFO L226 Difference]: Without dead ends: 168 [2019-01-08 14:09:15,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:09:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-08 14:09:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 140. [2019-01-08 14:09:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-08 14:09:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 839 transitions. [2019-01-08 14:09:15,200 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 839 transitions. Word has length 5 [2019-01-08 14:09:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:15,201 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 839 transitions. [2019-01-08 14:09:15,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 839 transitions. [2019-01-08 14:09:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:15,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:15,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:15,202 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:15,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:15,202 INFO L82 PathProgramCache]: Analyzing trace with hash 29290904, now seen corresponding path program 1 times [2019-01-08 14:09:15,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:15,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:15,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:15,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:15,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-08 14:09:15,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:15,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:15,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:15,321 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [27] [2019-01-08 14:09:15,322 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:15,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:15,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:15,325 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:15,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:15,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:15,326 INFO 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-08 14:09:15,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:15,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:15,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:15,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:09:15,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:15,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:09:15,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:09:15,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:09:15,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:09:15,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:09:15,460 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,499 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,520 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,536 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:15,583 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:09:15,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:09:15,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,688 INFO L267 ElimStorePlain]: Start 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-08 14:09:15,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:15,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,731 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:15,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 105 [2019-01-08 14:09:15,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,797 INFO L267 ElimStorePlain]: Start 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-08 14:09:15,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:15,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:15,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-08 14:09:15,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:15,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:15,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:15,993 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-08 14:09:15,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:16,020 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-08 14:09:16,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:16,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:09:16,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:16,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:09:16,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:09:16,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:09:16,039 INFO L87 Difference]: Start difference. First operand 140 states and 839 transitions. Second operand 10 states. [2019-01-08 14:09:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:18,156 INFO L93 Difference]: Finished difference Result 197 states and 973 transitions. [2019-01-08 14:09:18,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:09:18,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:09:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:18,160 INFO L225 Difference]: With dead ends: 197 [2019-01-08 14:09:18,160 INFO L226 Difference]: Without dead ends: 195 [2019-01-08 14:09:18,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:09:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-08 14:09:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2019-01-08 14:09:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-08 14:09:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 864 transitions. [2019-01-08 14:09:18,199 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 864 transitions. Word has length 5 [2019-01-08 14:09:18,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:18,199 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 864 transitions. [2019-01-08 14:09:18,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:18,200 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 864 transitions. [2019-01-08 14:09:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:18,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:18,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:18,201 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-08 14:09:18,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:18,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:18,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:18,591 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 21 [2019-01-08 14:09:18,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-08 14:09:18,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:18,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:18,648 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:18,648 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-08 14:09:18,650 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:18,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:18,653 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:18,654 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:18,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:18,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:18,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:09:18,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:18,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:18,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:18,816 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-08 14:09:18,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:09:18,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:18,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:18,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:09:18,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:09:18,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,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 28 treesize of output 54 [2019-01-08 14:09:18,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:09:18,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:18,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:09:18,871 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:18,908 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:18,928 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:18,944 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:18,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:18,967 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:18,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:18,990 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-08 14:09:19,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:09:19,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:19,091 INFO L267 ElimStorePlain]: Start 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-08 14:09:19,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:19,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-08 14:09:19,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:19,213 INFO L267 ElimStorePlain]: Start 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-08 14:09:19,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:19,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:19,279 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:19,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-01-08 14:09:19,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:19,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:19,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:09:19,585 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-08 14:09:19,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:19,621 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-08 14:09:19,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:19,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:09:19,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:19,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:09:19,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:09:19,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:09:19,642 INFO L87 Difference]: Start difference. First operand 146 states and 864 transitions. Second operand 10 states. [2019-01-08 14:09:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:22,736 INFO L93 Difference]: Finished difference Result 193 states and 995 transitions. [2019-01-08 14:09:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:09:22,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:09:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:22,739 INFO L225 Difference]: With dead ends: 193 [2019-01-08 14:09:22,739 INFO L226 Difference]: Without dead ends: 191 [2019-01-08 14:09:22,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:09:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-08 14:09:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 159. [2019-01-08 14:09:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-08 14:09:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 955 transitions. [2019-01-08 14:09:22,783 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 955 transitions. Word has length 5 [2019-01-08 14:09:22,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:22,783 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 955 transitions. [2019-01-08 14:09:22,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:22,783 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 955 transitions. [2019-01-08 14:09:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:22,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:22,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:22,784 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:22,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:22,784 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-08 14:09:22,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:22,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:22,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:22,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:23,105 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 21 [2019-01-08 14:09:23,160 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-08 14:09:23,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:23,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:23,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:23,161 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-08 14:09:23,162 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:23,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:23,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:23,164 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:23,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:23,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:23,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:23,165 INFO 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-08 14:09:23,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:23,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:23,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:23,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:23,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:09:23,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:09:23,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:09:23,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:09:23,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:09:23,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,346 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:09:23,437 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:23,459 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-08 14:09:23,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:09:23,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,568 INFO L267 ElimStorePlain]: Start 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-08 14:09:23,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:23,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-08 14:09:23,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,718 INFO L267 ElimStorePlain]: Start 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-08 14:09:23,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:23,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:23,764 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:23,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 123 [2019-01-08 14:09:23,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:23,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:23,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-08 14:09:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:24,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:24,106 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-08 14:09:24,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:24,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:09:24,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:24,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:09:24,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:09:24,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:09:24,124 INFO L87 Difference]: Start difference. First operand 159 states and 955 transitions. Second operand 10 states. [2019-01-08 14:09:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:27,340 INFO L93 Difference]: Finished difference Result 205 states and 1081 transitions. [2019-01-08 14:09:27,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:09:27,341 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:09:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:27,344 INFO L225 Difference]: With dead ends: 205 [2019-01-08 14:09:27,344 INFO L226 Difference]: Without dead ends: 203 [2019-01-08 14:09:27,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:09:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-08 14:09:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 166. [2019-01-08 14:09:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-08 14:09:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 1004 transitions. [2019-01-08 14:09:27,387 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 1004 transitions. Word has length 5 [2019-01-08 14:09:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:27,387 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 1004 transitions. [2019-01-08 14:09:27,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 1004 transitions. [2019-01-08 14:09:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:27,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:27,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:27,389 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:27,389 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-08 14:09:27,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:27,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:27,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:27,882 WARN L181 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2019-01-08 14:09:28,041 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-08 14:09:28,047 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-08 14:09:28,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:28,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:28,047 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:28,048 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-08 14:09:28,049 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:28,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:28,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:28,052 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:28,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:28,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:28,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:28,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 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-08 14:09:28,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:28,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:28,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:28,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 21 treesize of output 24 [2019-01-08 14:09:28,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-08 14:09:28,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,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 26 treesize of output 32 [2019-01-08 14:09:28,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,111 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 28 treesize of output 42 [2019-01-08 14:09:28,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-08 14:09:28,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-08 14:09:28,138 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:28,165 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:28,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:28,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:28,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:28,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:28,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-08 14:09:28,235 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:34, output treesize:43 [2019-01-08 14:09:28,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 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-08 14:09:28,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:28,326 INFO L267 ElimStorePlain]: Start 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-08 14:09:28,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:28,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:28,360 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:28,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 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-08 14:09:28,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:28,405 INFO L267 ElimStorePlain]: Start 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-08 14:09:28,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:28,446 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-08 14:09:28,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:28,469 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-08 14:09:28,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:28,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:09:28,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:28,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:09:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:09:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:09:28,489 INFO L87 Difference]: Start difference. First operand 166 states and 1004 transitions. Second operand 8 states. [2019-01-08 14:09:28,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:28,896 INFO L93 Difference]: Finished difference Result 189 states and 1032 transitions. [2019-01-08 14:09:28,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:09:28,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:09:28,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:28,899 INFO L225 Difference]: With dead ends: 189 [2019-01-08 14:09:28,899 INFO L226 Difference]: Without dead ends: 188 [2019-01-08 14:09:28,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:09:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-08 14:09:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2019-01-08 14:09:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-08 14:09:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 1004 transitions. [2019-01-08 14:09:28,933 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 1004 transitions. Word has length 5 [2019-01-08 14:09:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:28,933 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 1004 transitions. [2019-01-08 14:09:28,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:09:28,933 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 1004 transitions. [2019-01-08 14:09:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:28,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:28,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:28,934 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:28,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:28,934 INFO L82 PathProgramCache]: Analyzing trace with hash 29350486, now seen corresponding path program 2 times [2019-01-08 14:09:28,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:28,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:28,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:29,253 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 17 [2019-01-08 14:09:29,289 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-08 14:09:29,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:29,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:29,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:29,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:29,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:29,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:09:29,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:09:29,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:09:29,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:09:29,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:09:29,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:29,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 21 treesize of output 24 [2019-01-08 14:09:29,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:09:29,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,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 26 treesize of output 40 [2019-01-08 14:09:29,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:09:29,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:09:29,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:09:29,394 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,434 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:09:29,525 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:29,547 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:09:29,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:09:29,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,649 INFO L267 ElimStorePlain]: Start 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-08 14:09:29,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:29,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-08 14:09:29,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:29,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-08 14:09:29,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:29,805 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:29,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-08 14:09:29,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:29,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:29,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:09:29,962 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-08 14:09:29,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:29,987 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-08 14:09:30,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:30,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:09:30,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:30,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:09:30,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:09:30,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:09:30,007 INFO L87 Difference]: Start difference. First operand 166 states and 1004 transitions. Second operand 10 states. [2019-01-08 14:09:31,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:31,709 INFO L93 Difference]: Finished difference Result 250 states and 1294 transitions. [2019-01-08 14:09:31,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:09:31,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:09:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:31,712 INFO L225 Difference]: With dead ends: 250 [2019-01-08 14:09:31,712 INFO L226 Difference]: Without dead ends: 248 [2019-01-08 14:09:31,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:09:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-08 14:09:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 184. [2019-01-08 14:09:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-01-08 14:09:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 1130 transitions. [2019-01-08 14:09:31,744 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 1130 transitions. Word has length 5 [2019-01-08 14:09:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:31,744 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 1130 transitions. [2019-01-08 14:09:31,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 1130 transitions. [2019-01-08 14:09:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:31,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:31,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:31,745 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-08 14:09:31,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:31,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:09:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:31,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:31,930 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2019-01-08 14:09:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:31,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:31,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:31,955 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:31,955 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-08 14:09:31,956 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:31,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:31,958 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:31,959 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:31,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:31,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:31,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:09:31,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:31,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:31,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:32,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:32,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-08 14:09:32,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,051 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 26 treesize of output 32 [2019-01-08 14:09:32,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,062 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 28 treesize of output 42 [2019-01-08 14:09:32,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-08 14:09:32,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-08 14:09:32,089 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,119 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,190 INFO L267 ElimStorePlain]: Start 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-08 14:09:32,190 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:34, output treesize:43 [2019-01-08 14:09:32,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 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-08 14:09:32,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,277 INFO L267 ElimStorePlain]: Start 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-08 14:09:32,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:32,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:32,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-08 14:09:32,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:32,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:32,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:32,408 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-08 14:09:32,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:32,464 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-08 14:09:32,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:09:32,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:32,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:09:32,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:09:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:09:32,484 INFO L87 Difference]: Start difference. First operand 184 states and 1130 transitions. Second operand 8 states. [2019-01-08 14:09:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:33,051 INFO L93 Difference]: Finished difference Result 212 states and 1156 transitions. [2019-01-08 14:09:33,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:09:33,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:09:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:33,055 INFO L225 Difference]: With dead ends: 212 [2019-01-08 14:09:33,055 INFO L226 Difference]: Without dead ends: 210 [2019-01-08 14:09:33,055 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-08 14:09:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-08 14:09:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2019-01-08 14:09:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-08 14:09:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 1135 transitions. [2019-01-08 14:09:33,087 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 1135 transitions. Word has length 5 [2019-01-08 14:09:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:33,088 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 1135 transitions. [2019-01-08 14:09:33,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:09:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 1135 transitions. [2019-01-08 14:09:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:33,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:33,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:33,089 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 1 times [2019-01-08 14:09:33,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:33,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:33,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:33,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-08 14:09:33,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:33,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:33,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:33,181 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-08 14:09:33,181 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:33,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:33,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:33,184 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:33,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:33,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:33,185 INFO 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-08 14:09:33,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:33,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:33,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:33,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:09:33,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:33,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:09:33,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:09:33,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:09:33,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:09:33,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:09:33,327 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,366 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,387 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,428 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:33,449 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:09:33,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:09:33,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,552 INFO L267 ElimStorePlain]: Start 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-08 14:09:33,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:33,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,603 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:33,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-08 14:09:33,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:33,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-08 14:09:33,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:33,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-08 14:09:33,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:33,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:33,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:60, output treesize:50 [2019-01-08 14:09:33,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-08 14:09:33,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:33,970 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-08 14:09:33,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:33,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:09:33,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:33,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:09:33,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:09:33,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:09:33,990 INFO L87 Difference]: Start difference. First operand 188 states and 1135 transitions. Second operand 10 states. [2019-01-08 14:09:36,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:36,616 INFO L93 Difference]: Finished difference Result 250 states and 1266 transitions. [2019-01-08 14:09:36,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:09:36,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:09:36,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:36,620 INFO L225 Difference]: With dead ends: 250 [2019-01-08 14:09:36,620 INFO L226 Difference]: Without dead ends: 249 [2019-01-08 14:09:36,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 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-08 14:09:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-08 14:09:36,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 188. [2019-01-08 14:09:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-08 14:09:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 1135 transitions. [2019-01-08 14:09:36,651 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 1135 transitions. Word has length 5 [2019-01-08 14:09:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:36,651 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 1135 transitions. [2019-01-08 14:09:36,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 1135 transitions. [2019-01-08 14:09:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:36,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:36,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:36,652 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash 29354206, now seen corresponding path program 1 times [2019-01-08 14:09:36,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:36,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:37,273 WARN L181 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2019-01-08 14:09:37,329 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-08 14:09:37,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:37,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:37,330 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:37,330 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-08 14:09:37,330 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:37,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:37,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:37,333 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:37,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:37,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:37,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:37,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:09:37,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:37,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:37,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:37,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:37,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,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 24 treesize of output 30 [2019-01-08 14:09:37,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:09:37,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:09:37,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:09:37,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:09:37,427 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,484 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:09:37,552 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:37,575 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:45, output treesize:46 [2019-01-08 14:09:37,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:09:37,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,677 INFO L267 ElimStorePlain]: Start 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-08 14:09:37,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:37,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,725 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:37,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-08 14:09:37,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:37,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-08 14:09:37,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:37,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-08 14:09:37,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:37,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:37,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:60, output treesize:50 [2019-01-08 14:09:38,182 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-08 14:09:38,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:38,222 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-08 14:09:38,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:38,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-08 14:09:38,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:38,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:09:38,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:09:38,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:09:38,241 INFO L87 Difference]: Start difference. First operand 188 states and 1135 transitions. Second operand 10 states. [2019-01-08 14:09:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:41,546 INFO L93 Difference]: Finished difference Result 235 states and 1253 transitions. [2019-01-08 14:09:41,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:09:41,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:09:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:41,550 INFO L225 Difference]: With dead ends: 235 [2019-01-08 14:09:41,550 INFO L226 Difference]: Without dead ends: 233 [2019-01-08 14:09:41,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:09:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-01-08 14:09:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 199. [2019-01-08 14:09:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-08 14:09:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 1211 transitions. [2019-01-08 14:09:41,582 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 1211 transitions. Word has length 5 [2019-01-08 14:09:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:41,582 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 1211 transitions. [2019-01-08 14:09:41,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:41,582 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 1211 transitions. [2019-01-08 14:09:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:41,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:41,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:41,583 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:41,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:41,583 INFO L82 PathProgramCache]: Analyzing trace with hash 29358486, now seen corresponding path program 1 times [2019-01-08 14:09:41,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:41,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:41,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:41,659 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-08 14:09:41,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:41,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:41,660 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:41,660 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [28], [29] [2019-01-08 14:09:41,661 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:41,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:41,664 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:41,664 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:41,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:41,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:41,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 14:09:41,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:41,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:41,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:41,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:41,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-08 14:09:41,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,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 26 treesize of output 32 [2019-01-08 14:09:41,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,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 28 treesize of output 42 [2019-01-08 14:09:41,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2019-01-08 14:09:41,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-08 14:09:41,736 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:41,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:41,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:41,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:41,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:41,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:41,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-08 14:09:41,848 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:34, output treesize:43 [2019-01-08 14:09:41,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 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-08 14:09:41,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:41,930 INFO L267 ElimStorePlain]: Start 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-08 14:09:41,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-08 14:09:41,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:41,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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-08 14:09:42,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,054 INFO L267 ElimStorePlain]: Start 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-08 14:09:42,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-08 14:09:42,082 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-08 14:09:42,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:42,104 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-08 14:09:42,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:42,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-08 14:09:42,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:42,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:09:42,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:09:42,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:09:42,124 INFO L87 Difference]: Start difference. First operand 199 states and 1211 transitions. Second operand 8 states. [2019-01-08 14:09:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:42,551 INFO L93 Difference]: Finished difference Result 223 states and 1233 transitions. [2019-01-08 14:09:42,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:09:42,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-08 14:09:42,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:42,554 INFO L225 Difference]: With dead ends: 223 [2019-01-08 14:09:42,554 INFO L226 Difference]: Without dead ends: 222 [2019-01-08 14:09:42,555 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-08 14:09:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-08 14:09:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2019-01-08 14:09:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-08 14:09:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 1211 transitions. [2019-01-08 14:09:42,592 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 1211 transitions. Word has length 5 [2019-01-08 14:09:42,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:42,592 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 1211 transitions. [2019-01-08 14:09:42,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:09:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 1211 transitions. [2019-01-08 14:09:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:42,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:42,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:42,593 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:42,594 INFO L82 PathProgramCache]: Analyzing trace with hash 28933598, now seen corresponding path program 2 times [2019-01-08 14:09:42,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:42,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:42,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:42,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:42,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-08 14:09:42,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:42,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:42,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:09:42,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:09:42,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:42,691 INFO 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-08 14:09:42,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:09:42,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:09:42,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:09:42,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:09:42,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:42,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:42,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:09:42,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-08 14:09:42,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-08 14:09:42,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-08 14:09:42,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-08 14:09:42,801 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-08 14:09:42,929 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:42,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:42,950 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-08 14:09:42,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:42,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-08 14:09:43,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:43,071 INFO L267 ElimStorePlain]: Start 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-08 14:09:43,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-08 14:09:43,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-08 14:09:43,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:43,186 INFO L267 ElimStorePlain]: Start 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-08 14:09:43,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:48 [2019-01-08 14:09:43,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:43,236 INFO L683 Elim1Store]: detected equality via solver [2019-01-08 14:09:43,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 134 [2019-01-08 14:09:43,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:43,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:43,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-08 14:09:43,422 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-08 14:09:43,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:09:43,449 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-08 14:09:43,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:09:43,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-08 14:09:43,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:09:43,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:09:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:09:43,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-08 14:09:43,469 INFO L87 Difference]: Start difference. First operand 199 states and 1211 transitions. Second operand 10 states. [2019-01-08 14:09:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:09:45,608 INFO L93 Difference]: Finished difference Result 284 states and 1495 transitions. [2019-01-08 14:09:45,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:09:45,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-08 14:09:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:09:45,612 INFO L225 Difference]: With dead ends: 284 [2019-01-08 14:09:45,612 INFO L226 Difference]: Without dead ends: 280 [2019-01-08 14:09:45,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:09:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-08 14:09:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 211. [2019-01-08 14:09:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-08 14:09:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 1290 transitions. [2019-01-08 14:09:45,652 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 1290 transitions. Word has length 5 [2019-01-08 14:09:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:09:45,652 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 1290 transitions. [2019-01-08 14:09:45,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:09:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 1290 transitions. [2019-01-08 14:09:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 14:09:45,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:09:45,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 14:09:45,653 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:09:45,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:45,654 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-08 14:09:45,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:09:45,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:45,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:09:45,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:09:45,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:09:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:45,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:09:45,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:45,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:09:45,746 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-08 14:09:45,746 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-08 14:09:45,748 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 14:09:45,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:09:45,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:09:45,750 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 3. Performed 78 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-08 14:09:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:09:45,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:09:45,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:09:45,751 INFO 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-08 14:09:45,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:09:45,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:09:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:09:45,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:09:45,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-08 14:09:45,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-08 14:09:45,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-08 14:09:45,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-08 14:09:45,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 60 [2019-01-08 14:09:45,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:45,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-08 14:09:45,833 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,864 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,882 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2019-01-08 14:09:45,946 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:45,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-08 14:09:45,968 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-01-08 14:09:48,000 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-08 14:09:48,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 81 [2019-01-08 14:09:48,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:09:48,071 INFO L267 ElimStorePlain]: Start 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-08 14:09:48,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:43 [2019-01-08 14:09:48,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-08 14:09:48,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 43 treesize of output 105 [2019-01-08 14:09:48,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-08 14:09:48,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-08 14:09:48,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:206 [2019-01-08 14:09:51,632 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:09:51,634 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.push(DiffWrapperScript.java:93) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.push(WrapperScript.java:101) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UndoableWrapperScript.push(UndoableWrapperScript.java:52) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 46 more [2019-01-08 14:09:51,639 INFO L168 Benchmark]: Toolchain (without parser) took 309851.40 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 853.5 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -336.0 MB). Peak memory consumption was 517.6 MB. Max. memory is 7.1 GB. [2019-01-08 14:09:51,640 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-08 14:09:51,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.27 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-08 14:09:51,640 INFO L168 Benchmark]: Boogie Preprocessor took 23.11 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-08 14:09:51,640 INFO L168 Benchmark]: RCFGBuilder took 541.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-08 14:09:51,641 INFO L168 Benchmark]: TraceAbstraction took 309221.38 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 853.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -357.1 MB). Peak memory consumption was 496.4 MB. Max. memory is 7.1 GB. [2019-01-08 14:09:51,642 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 58.27 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 23.11 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 541.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 309221.38 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 853.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -357.1 MB). Peak memory consumption was 496.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...