java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:22:13,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:22:13,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:22:13,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:22:13,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:22:13,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:22:13,739 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:22:13,741 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:22:13,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:22:13,744 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:22:13,745 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:22:13,745 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:22:13,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:22:13,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:22:13,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:22:13,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:22:13,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:22:13,752 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:22:13,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:22:13,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:22:13,757 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:22:13,758 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:22:13,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:22:13,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:22:13,761 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:22:13,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:22:13,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:22:13,764 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:22:13,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:22:13,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:22:13,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:22:13,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:22:13,766 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:22:13,767 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:22:13,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:22:13,768 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:22:13,769 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-11 14:22:13,783 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:22:13,783 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:22:13,784 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:22:13,784 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:22:13,784 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:22:13,784 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:22:13,785 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:22:13,785 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:22:13,785 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:22:13,785 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:22:13,785 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:22:13,785 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:22:13,786 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:22:13,786 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:22:13,786 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:22:13,787 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:22:13,787 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:22:13,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:22:13,787 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:22:13,788 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:22:13,788 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:22:13,788 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:22:13,788 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:22:13,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:22:13,788 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:22:13,789 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:22:13,789 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:22:13,789 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:22:13,789 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:22:13,790 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:22:13,790 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:22:13,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:22:13,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:22:13,790 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:22:13,790 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:22:13,791 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:22:13,791 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:22:13,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:22:13,791 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:22:13,791 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:22:13,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:22:13,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:22:13,834 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:22:13,835 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:22:13,836 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:22:13,837 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-01-11 14:22:13,837 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-01-11 14:22:13,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:22:13,876 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:22:13,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:22:13,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:22:13,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:22:13,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/1) ... [2019-01-11 14:22:13,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/1) ... [2019-01-11 14:22:13,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:22:13,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:22:13,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:22:13,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:22:13,939 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/1) ... [2019-01-11 14:22:13,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/1) ... [2019-01-11 14:22:13,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/1) ... [2019-01-11 14:22:13,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/1) ... [2019-01-11 14:22:13,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/1) ... [2019-01-11 14:22:13,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/1) ... [2019-01-11 14:22:13,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/1) ... [2019-01-11 14:22:13,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:22:13,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:22:13,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:22:13,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:22:13,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (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-11 14:22:14,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:22:14,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:22:14,314 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:22:14,314 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-11 14:22:14,316 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:22:14 BoogieIcfgContainer [2019-01-11 14:22:14,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:22:14,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:22:14,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:22:14,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:22:14,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:22:13" (1/2) ... [2019-01-11 14:22:14,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d61421 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:22:14, skipping insertion in model container [2019-01-11 14:22:14,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:22:14" (2/2) ... [2019-01-11 14:22:14,323 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-01-11 14:22:14,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:22:14,341 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-11 14:22:14,355 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-11 14:22:14,385 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:22:14,385 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:22:14,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:22:14,386 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:22:14,386 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:22:14,386 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:22:14,386 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:22:14,386 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:22:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-11 14:22:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 14:22:14,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:14,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 14:22:14,409 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:14,415 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-11 14:22:14,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:14,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:14,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:14,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:14,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:14,635 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-11 14:22:14,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:22:14,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:22:14,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:14,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:22:14,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:22:14,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:14,668 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-11 14:22:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:14,874 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-11 14:22:14,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:14,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 14:22:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:14,889 INFO L225 Difference]: With dead ends: 21 [2019-01-11 14:22:14,890 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 14:22:14,893 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-11 14:22:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 14:22:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-11 14:22:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-11 14:22:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-11 14:22:14,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-11 14:22:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:14,928 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-11 14:22:14,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:22:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-11 14:22:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:14,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:14,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:14,930 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:14,930 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-11 14:22:14,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:14,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:14,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:14,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:14,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:15,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:15,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:15,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:22:15,154 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-11 14:22:15,183 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:15,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:15,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:15,249 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:15,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:15,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:15,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:15,266 INFO 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-11 14:22:15,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:15,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:15,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:15,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:15,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:15,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:15,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:15,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:15,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:15,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:15,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:15,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:15,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:15,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:15,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:15,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:15,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:15,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:16,016 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 14:22:16,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:16,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:16,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:16,226 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-11 14:22:16,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:16,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:16,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:16,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:16,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:16,249 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:16,268 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:16,297 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:16,335 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-11 14:22:16,336 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:16,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:16,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:16,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:16,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:16,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:16,586 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-11 14:22:16,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:16,619 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-11 14:22:16,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:16,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:16,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:16,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:16,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:16,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:16,641 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-11 14:22:16,947 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-11 14:22:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:17,196 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-11 14:22:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:17,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:22:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:17,199 INFO L225 Difference]: With dead ends: 31 [2019-01-11 14:22:17,199 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 14:22:17,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 14:22:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-11 14:22:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 14:22:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-11 14:22:17,207 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-11 14:22:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:17,207 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-11 14:22:17,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:17,207 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-11 14:22:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:17,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:17,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:17,208 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-11 14:22:17,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:17,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:17,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:17,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:17,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:17,245 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-11 14:22:17,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:22:17,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:22:17,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:17,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:22:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:22:17,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:22:17,248 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-11 14:22:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:17,314 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-11 14:22:17,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:17,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 14:22:17,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:17,316 INFO L225 Difference]: With dead ends: 15 [2019-01-11 14:22:17,316 INFO L226 Difference]: Without dead ends: 14 [2019-01-11 14:22:17,316 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-11 14:22:17,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-11 14:22:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-11 14:22:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 14:22:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-11 14:22:17,321 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-11 14:22:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:17,322 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-11 14:22:17,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:22:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-11 14:22:17,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:17,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:17,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:17,323 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-11 14:22:17,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:17,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:17,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:17,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:17,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:17,466 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-11 14:22:17,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:17,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:17,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:22:17,468 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-11 14:22:17,470 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:17,471 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:17,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:17,476 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:17,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:17,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:17,477 INFO 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-11 14:22:17,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:17,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:17,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:17,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:17,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:17,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:17,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:17,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:17,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:22:17,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:17,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:17,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:17,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:17,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:17,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-11 14:22:17,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:17,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:17,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:22:17,708 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:17,712 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:17,731 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-11 14:22:17,731 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-01-11 14:22:17,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:17,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:22:17,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:17,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:17,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-11 14:22:17,820 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-11 14:22:17,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:17,928 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-11 14:22:17,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:22:17,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 14:22:17,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:17,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:22:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:22:17,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:17,947 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-11 14:22:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:18,035 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-11 14:22:18,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:22:18,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 14:22:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:18,037 INFO L225 Difference]: With dead ends: 18 [2019-01-11 14:22:18,037 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 14:22:18,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 14:22:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-11 14:22:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 14:22:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-11 14:22:18,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-11 14:22:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:18,044 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-11 14:22:18,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:22:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-11 14:22:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:22:18,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:18,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:22:18,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-11 14:22:18,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:18,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:18,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:18,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:18,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:18,106 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-11 14:22:18,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:18,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:18,107 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:22:18,107 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-11 14:22:18,108 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:18,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:18,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:18,115 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:18,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:18,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:18,115 INFO 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-11 14:22:18,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:18,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:18,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:18,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:18,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-11 14:22:18,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:18,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:18,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:22:18,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:18,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:18,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:18,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:18,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:18,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:22:18,284 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:18,333 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:18,343 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:18,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:18,370 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-11 14:22:18,370 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-11 14:22:18,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:18,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:22:18,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:18,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:18,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-11 14:22:18,458 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-11 14:22:18,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:18,471 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-11 14:22:18,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:18,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:18,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:18,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:18,490 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-11 14:22:18,637 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-01-11 14:22:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:18,731 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-11 14:22:18,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:18,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:22:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:18,733 INFO L225 Difference]: With dead ends: 32 [2019-01-11 14:22:18,733 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 14:22:18,734 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-11 14:22:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 14:22:18,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-11 14:22:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 14:22:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-11 14:22:18,740 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-11 14:22:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:18,741 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-11 14:22:18,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-11 14:22:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:18,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:18,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:18,742 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:18,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-11 14:22:18,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:18,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:18,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:18,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:18,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:18,863 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-11 14:22:18,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:18,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:18,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:18,864 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-11 14:22:18,867 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:18,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:18,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:18,877 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:18,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:18,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:18,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:18,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:18,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:18,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:18,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:18,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:18,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:18,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:18,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:19,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:19,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:19,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:19,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:19,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:19,081 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,107 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,117 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,149 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,166 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-11 14:22:19,166 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:19,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:19,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:19,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:19,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:19,257 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-11 14:22:19,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:22:19,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:22:19,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:19,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:22:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:22:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:22:19,277 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-11 14:22:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:19,316 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-11 14:22:19,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:22:19,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:22:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:19,317 INFO L225 Difference]: With dead ends: 22 [2019-01-11 14:22:19,317 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 14:22:19,317 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-11 14:22:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 14:22:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-11 14:22:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 14:22:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-11 14:22:19,324 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-11 14:22:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:19,324 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-11 14:22:19,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:22:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-11 14:22:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:19,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:19,325 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:19,325 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:19,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-11 14:22:19,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:19,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:19,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:19,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:19,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:19,387 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-11 14:22:19,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:19,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:19,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:19,388 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-11 14:22:19,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:19,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:19,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:19,393 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:19,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:19,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:19,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:19,394 INFO 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-11 14:22:19,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:19,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:19,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:19,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:19,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:19,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:19,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:19,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:19,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:19,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,749 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-11 14:22:19,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:19,750 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,790 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,800 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:19,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:19,822 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:19,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:19,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:19,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:20,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:20,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:20,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,110 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:20,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:22:20,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:20,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:20,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-11 14:22:20,183 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-11 14:22:20,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:20,208 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-11 14:22:20,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:20,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:20,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:20,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:20,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:20,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:20,230 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-11 14:22:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:20,674 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-11 14:22:20,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:20,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:20,676 INFO L225 Difference]: With dead ends: 37 [2019-01-11 14:22:20,676 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 14:22:20,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 14:22:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-11 14:22:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 14:22:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-11 14:22:20,682 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-11 14:22:20,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:20,682 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-11 14:22:20,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-11 14:22:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:20,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:20,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:20,683 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-11 14:22:20,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:20,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:20,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:20,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:20,768 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-11 14:22:20,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:20,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:20,769 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:20,770 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-11 14:22:20,772 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:20,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:20,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:20,777 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:20,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:20,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:20,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:20,778 INFO 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-11 14:22:20,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:20,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:20,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:20,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:20,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:20,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:20,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:20,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:20,951 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:20,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:20,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:20,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:20,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:21,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:21,002 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:21,057 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:21,066 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:21,074 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:21,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:21,106 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:21,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:21,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:21,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:21,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:21,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:21,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:21,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:21,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:21,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:21,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:21,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:21,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:22:21,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:21,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:21,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:21,261 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-11 14:22:21,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:21,306 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-11 14:22:21,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:21,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:21,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:21,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:21,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:21,326 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-11 14:22:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:21,768 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-01-11 14:22:21,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:21,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:21,770 INFO L225 Difference]: With dead ends: 46 [2019-01-11 14:22:21,770 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 14:22:21,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:22:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 14:22:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-01-11 14:22:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-11 14:22:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-11 14:22:21,784 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-11 14:22:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:21,786 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-11 14:22:21,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-11 14:22:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:21,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:21,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:21,788 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-11 14:22:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:21,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:21,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:21,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:21,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:21,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:21,911 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:21,911 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-11 14:22:21,912 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:21,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:21,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:21,916 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:21,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:21,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:21,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:21,917 INFO 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-11 14:22:21,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:21,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:21,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:21,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:21,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:22,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:22,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:22,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:22,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:22,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:22,222 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,231 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,259 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-11 14:22:22,259 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:22,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:22,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:22,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:22,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:22:22,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:22,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 14:22:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:22,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:22,388 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-11 14:22:22,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:22,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:22,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:22,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:22,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:22,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:22,407 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-11 14:22:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:22,602 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-01-11 14:22:22,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:22,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:22,603 INFO L225 Difference]: With dead ends: 52 [2019-01-11 14:22:22,603 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 14:22:22,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 14:22:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-01-11 14:22:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 14:22:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-01-11 14:22:22,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-01-11 14:22:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:22,612 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-01-11 14:22:22,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-01-11 14:22:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:22,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:22,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:22,613 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:22,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:22,613 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-11 14:22:22,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:22,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:22,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:22,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:22,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:22,661 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-11 14:22:22,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:22,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:22,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:22,662 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-11 14:22:22,663 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:22,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:22,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:22,667 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:22,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:22,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:22,667 INFO 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-11 14:22:22,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:22,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:22,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:22,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-11 14:22:22,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:22:22,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:22,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:22,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:22,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:22:22,767 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,776 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,785 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,803 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-11 14:22:22,803 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-11 14:22:22,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:22,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:22:22,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:22,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:22,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-11 14:22:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:22,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:22,919 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-11 14:22:22,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:22,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:22,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:22,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:22,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:22,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:22,938 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-01-11 14:22:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:23,122 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-01-11 14:22:23,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:23,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:22:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:23,123 INFO L225 Difference]: With dead ends: 36 [2019-01-11 14:22:23,123 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 14:22:23,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:23,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 14:22:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-01-11 14:22:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 14:22:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-01-11 14:22:23,132 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-01-11 14:22:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:23,132 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-01-11 14:22:23,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-01-11 14:22:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:23,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:23,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:23,133 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:23,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-11 14:22:23,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:23,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:23,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:23,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:23,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:23,194 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-11 14:22:23,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:23,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:23,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:23,195 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-11 14:22:23,196 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:23,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:23,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:23,200 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:23,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:23,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:23,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:23,201 INFO 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-11 14:22:23,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:23,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:23,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:23,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:23,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:23,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:23,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:23,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:23,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:23,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:23,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:23,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:23,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:23,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:23,417 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:23,427 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:23,439 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:23,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:23,460 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:23,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:23,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:23,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:23,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:23,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:23,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:22:23,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:23,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:23,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:23,645 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-11 14:22:23,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:23,667 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-11 14:22:23,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:23,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:23,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:23,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:23,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:23,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:23,688 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-01-11 14:22:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:24,054 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-01-11 14:22:24,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:24,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:22:24,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:24,056 INFO L225 Difference]: With dead ends: 52 [2019-01-11 14:22:24,056 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 14:22:24,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 14:22:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-01-11 14:22:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 14:22:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-01-11 14:22:24,075 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-01-11 14:22:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:24,076 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-01-11 14:22:24,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-01-11 14:22:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:22:24,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:24,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:22:24,077 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:24,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:24,077 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-11 14:22:24,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:24,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:24,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:24,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:24,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:24,106 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-11 14:22:24,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:24,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:24,107 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:22:24,108 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-11 14:22:24,111 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:24,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:24,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:24,114 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:22:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:24,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:24,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:24,115 INFO 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-11 14:22:24,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:24,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:24,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:24,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:24,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:22:24,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-11 14:22:24,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-11 14:22:24,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:22:24,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:22:24,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:22:24,298 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,308 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,317 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,334 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-11 14:22:24,335 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-01-11 14:22:24,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-01-11 14:22:24,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:24,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-11 14:22:24,431 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-11 14:22:24,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:24,440 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-11 14:22:24,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:24,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:22:24,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:24,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:22:24,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:22:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:22:24,459 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-01-11 14:22:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:24,580 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-01-11 14:22:24,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:22:24,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:22:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:24,582 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:22:24,582 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 14:22:24,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:22:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 14:22:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-01-11 14:22:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 14:22:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-11 14:22:24,592 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-01-11 14:22:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:24,592 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-11 14:22:24,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:22:24,593 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-11 14:22:24,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:24,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:24,593 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 14:22:24,594 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:24,594 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-01-11 14:22:24,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:24,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:24,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:24,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:24,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:24,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:24,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:24,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:24,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:24,651 INFO 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-11 14:22:24,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:24,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:24,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:22:24,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:24,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:24,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:24,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:24,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:24,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:24,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:24,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:24,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:24,813 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,829 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,846 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,865 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-11 14:22:24,865 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:24,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:24,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:24,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:24,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-11 14:22:24,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:24,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:24,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-01-11 14:22:24,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:24,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:24,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:25,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:25,014 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-11 14:22:25,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:25,042 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-11 14:22:25,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:25,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:22:25,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:25,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:22:25,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:22:25,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:25,062 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-01-11 14:22:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:25,420 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-01-11 14:22:25,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:25,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-11 14:22:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:25,422 INFO L225 Difference]: With dead ends: 65 [2019-01-11 14:22:25,422 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 14:22:25,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:22:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 14:22:25,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-01-11 14:22:25,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:22:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-11 14:22:25,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-11 14:22:25,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:25,432 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-11 14:22:25,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:22:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-11 14:22:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:25,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:25,433 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 14:22:25,433 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:25,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:25,434 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-01-11 14:22:25,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:25,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:25,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:25,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:25,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:25,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:25,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:25,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:25,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:25,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:25,513 INFO 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-11 14:22:25,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:25,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:25,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:22:25,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:25,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:25,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:25,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:25,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:25,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:25,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:25,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:25,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:25,707 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,717 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,725 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:25,744 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:25,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:25,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:25,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:25,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-11 14:22:25,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:25,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-11 14:22:25,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:25,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:22:25,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:25,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:25,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:25,940 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-11 14:22:25,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:25,994 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-11 14:22:26,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:26,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 14:22:26,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:26,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:22:26,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:22:26,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:22:26,014 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-01-11 14:22:26,237 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-01-11 14:22:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:26,474 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-01-11 14:22:26,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:26,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-11 14:22:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:26,476 INFO L225 Difference]: With dead ends: 53 [2019-01-11 14:22:26,476 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 14:22:26,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 14:22:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-01-11 14:22:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 14:22:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-11 14:22:26,486 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-11 14:22:26,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:26,487 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-11 14:22:26,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:22:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-11 14:22:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:26,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:26,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:26,488 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:26,488 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-11 14:22:26,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:26,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:26,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:26,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:26,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:26,595 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-11 14:22:26,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:26,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:26,596 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:26,596 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-11 14:22:26,597 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:26,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:26,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:26,602 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:26,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:26,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:26,602 INFO 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-11 14:22:26,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:26,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:26,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:26,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:26,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:26,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:26,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:26,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:26,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:26,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:26,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:26,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:26,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:26,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:26,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:26,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:26,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:26,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:26,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:26,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:26,845 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:26,869 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:26,881 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:26,893 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:26,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:26,922 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:26,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:26,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:26,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:26,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:26,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:27,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:27,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:27,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:27,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:27,100 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-11 14:22:27,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:27,128 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-11 14:22:27,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:27,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:27,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:27,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:27,147 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-01-11 14:22:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:27,372 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-01-11 14:22:27,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:27,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:22:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:27,374 INFO L225 Difference]: With dead ends: 54 [2019-01-11 14:22:27,374 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 14:22:27,375 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-11 14:22:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 14:22:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-01-11 14:22:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 14:22:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-01-11 14:22:27,386 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-01-11 14:22:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:27,386 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-01-11 14:22:27,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-01-11 14:22:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:27,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:27,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:27,388 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-01-11 14:22:27,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:27,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:27,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:27,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:27,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:27,513 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-11 14:22:27,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:27,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:27,514 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:27,514 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-11 14:22:27,517 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:27,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:27,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:27,521 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:27,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:27,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:27,521 INFO 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-11 14:22:27,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:27,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:27,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:27,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:27,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:27,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:27,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:22:27,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:27,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:27,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:27,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:27,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-11 14:22:27,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:22:27,688 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:27,718 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:27,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:27,733 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-11 14:22:27,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:27,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 14:22:27,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-01-11 14:22:27,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:116 [2019-01-11 14:22:27,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:27,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:27,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:22:27,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:28,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,039 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:28,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2019-01-11 14:22:28,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:28,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2019-01-11 14:22:28,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:28,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-11 14:22:28,139 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:105, output treesize:61 [2019-01-11 14:22:28,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-11 14:22:28,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:28,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-01-11 14:22:28,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:28,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:28,286 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:28,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-01-11 14:22:28,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:28,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-11 14:22:28,321 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-01-11 14:22:28,357 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-11 14:22:28,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:28,372 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-11 14:22:28,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:28,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-01-11 14:22:28,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:28,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:28,393 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-01-11 14:22:29,149 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 42 [2019-01-11 14:22:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:29,820 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-01-11 14:22:29,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 14:22:29,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:22:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:29,821 INFO L225 Difference]: With dead ends: 81 [2019-01-11 14:22:29,821 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 14:22:29,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:22:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 14:22:29,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-01-11 14:22:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 14:22:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-01-11 14:22:29,836 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-01-11 14:22:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:29,836 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-01-11 14:22:29,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-01-11 14:22:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:29,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:29,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:29,837 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:29,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-11 14:22:29,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:29,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:29,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:29,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:29,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:29,996 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:22:30,213 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-11 14:22:30,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:30,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:30,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:30,214 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-11 14:22:30,215 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:30,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:30,220 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:30,220 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:30,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:30,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:30,220 INFO 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-11 14:22:30,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:30,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:30,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:30,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:30,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 18 treesize of output 24 [2019-01-11 14:22:30,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:30,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:30,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:30,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:30,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:30,393 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,402 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,411 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,430 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:30,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:30,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:30,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:30,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,544 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:30,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:22:30,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:30,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-01-11 14:22:30,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:30,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-11 14:22:30,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:30,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:30,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 14:22:30,837 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-11 14:22:30,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:31,521 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-11 14:22:31,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:31,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:22:31,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:31,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:22:31,584 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-01-11 14:22:32,069 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-01-11 14:22:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:32,472 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-11 14:22:32,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:32,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:22:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:32,474 INFO L225 Difference]: With dead ends: 66 [2019-01-11 14:22:32,474 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 14:22:32,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:22:32,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 14:22:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-01-11 14:22:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 14:22:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-11 14:22:32,490 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-11 14:22:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:32,490 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-11 14:22:32,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-11 14:22:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:32,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:32,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:32,491 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:32,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:32,491 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-11 14:22:32,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:32,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:32,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:32,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:32,568 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-11 14:22:32,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:32,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:32,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:32,569 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-11 14:22:32,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:32,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:32,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:32,575 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:32,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:32,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:32,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:32,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:32,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:32,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:32,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:22:32,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:32,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:32,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:22:32,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:32,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:32,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:32,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:32,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:22:32,650 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:32,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:32,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:32,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:32,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:22:32,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-11 14:22:32,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-11 14:22:32,761 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:32,993 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,100 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,109 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:33,125 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-11 14:22:33,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:22:33,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:33,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:22:33,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:22:33,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:33,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-11 14:22:33,298 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-11 14:22:33,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:33,325 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-11 14:22:33,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:33,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:33,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:33,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:33,346 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-01-11 14:22:33,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:33,549 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-01-11 14:22:33,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:33,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:22:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:33,551 INFO L225 Difference]: With dead ends: 62 [2019-01-11 14:22:33,551 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 14:22:33,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:33,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 14:22:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-01-11 14:22:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 14:22:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-01-11 14:22:33,567 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-01-11 14:22:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:33,567 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-01-11 14:22:33,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-01-11 14:22:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:33,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:33,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:33,568 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:33,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:33,568 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-11 14:22:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:33,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:33,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:33,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:33,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:33,629 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-11 14:22:33,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:22:33,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:22:33,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:22:33,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:22:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:22:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:22:33,630 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-01-11 14:22:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:33,684 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-01-11 14:22:33,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:22:33,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:22:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:33,686 INFO L225 Difference]: With dead ends: 51 [2019-01-11 14:22:33,686 INFO L226 Difference]: Without dead ends: 46 [2019-01-11 14:22:33,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:22:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-11 14:22:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-01-11 14:22:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 14:22:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-01-11 14:22:33,703 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-01-11 14:22:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:33,703 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-01-11 14:22:33,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:22:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-01-11 14:22:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:33,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:33,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:33,704 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:33,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:33,705 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-01-11 14:22:33,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:33,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:33,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:33,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:33,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:33,800 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-11 14:22:33,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:33,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:33,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:33,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:33,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:33,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:33,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:33,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:33,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:22:33,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:33,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:33,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:33,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:33,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:33,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:33,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:33,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:33,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:34,240 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 14:22:34,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:34,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:34,282 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:34,292 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:34,301 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:34,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:34,343 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:34,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:34,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:34,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:34,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:34,611 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-11 14:22:34,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:34,763 INFO L303 Elim1Store]: Index analysis took 148 ms [2019-01-11 14:22:34,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:22:34,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:35,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 14:22:35,357 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-11 14:22:35,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:35,636 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:35,637 INFO L303 Elim1Store]: Index analysis took 276 ms [2019-01-11 14:22:35,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:22:35,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:35,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:35,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:22:35,850 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-11 14:22:35,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:35,878 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-11 14:22:35,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:35,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:22:35,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:35,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:35,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:35,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:35,898 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-01-11 14:22:36,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:36,641 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-01-11 14:22:36,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:22:36,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:22:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:36,643 INFO L225 Difference]: With dead ends: 90 [2019-01-11 14:22:36,643 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 14:22:36,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:22:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 14:22:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-01-11 14:22:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 14:22:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-01-11 14:22:36,666 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-01-11 14:22:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:36,666 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-01-11 14:22:36,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-01-11 14:22:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:36,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:36,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:36,667 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:36,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:36,667 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-11 14:22:36,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:36,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:36,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:36,735 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-11 14:22:36,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:36,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:36,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:36,736 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-11 14:22:36,737 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:36,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:36,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:36,740 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:36,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:36,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:36,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:36,741 INFO 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-11 14:22:36,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:36,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:36,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:36,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:36,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:36,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:36,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:36,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:36,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:36,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:36,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:36,936 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,946 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,954 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:36,979 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-11 14:22:36,980 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:37,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:37,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:37,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:37,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:22:37,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:37,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 14:22:37,411 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-11 14:22:37,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:37,503 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-11 14:22:37,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:37,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:37,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:37,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:37,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:37,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:37,523 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-01-11 14:22:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:37,674 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-01-11 14:22:37,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:37,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:22:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:37,676 INFO L225 Difference]: With dead ends: 66 [2019-01-11 14:22:37,676 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 14:22:37,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 14:22:37,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-01-11 14:22:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 14:22:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-01-11 14:22:37,699 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-01-11 14:22:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:37,700 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-01-11 14:22:37,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-01-11 14:22:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:37,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:37,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:37,701 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:37,701 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-11 14:22:37,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:37,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:37,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:37,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:37,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:37,796 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-11 14:22:37,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:37,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:37,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:22:37,797 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-11 14:22:37,799 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:37,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:37,802 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:37,802 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:37,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:37,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:37,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:37,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:37,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:37,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:37,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:37,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:37,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:37,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:37,895 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:37,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:37,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:37,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:37,938 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,952 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,962 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:37,969 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:38,146 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:38,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:38,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:38,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:38,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,252 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:38,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-01-11 14:22:38,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:38,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 14:22:38,287 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-11 14:22:38,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:38,306 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-11 14:22:38,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:38,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:22:38,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:38,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:22:38,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:22:38,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:38,328 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-01-11 14:22:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:38,560 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-01-11 14:22:38,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:38,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-11 14:22:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:38,563 INFO L225 Difference]: With dead ends: 63 [2019-01-11 14:22:38,563 INFO L226 Difference]: Without dead ends: 62 [2019-01-11 14:22:38,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:22:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-11 14:22:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-11 14:22:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 14:22:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-01-11 14:22:38,581 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-01-11 14:22:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:38,581 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-01-11 14:22:38,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:22:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-01-11 14:22:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:22:38,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:38,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:22:38,583 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-11 14:22:38,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:38,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:38,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:38,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:38,806 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-11 14:22:38,815 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-11 14:22:38,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:38,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:38,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:38,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:38,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:38,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:38,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:38,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:38,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:22:38,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:38,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:38,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:38,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:38,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:38,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:38,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,899 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:38,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:38,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:38,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:39,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:39,011 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,021 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,030 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,048 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-11 14:22:39,049 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:39,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:39,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:39,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:39,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:39,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:39,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:39,148 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-11 14:22:39,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:39,166 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-11 14:22:39,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:39,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:39,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:39,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:39,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:39,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:39,187 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-01-11 14:22:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:39,381 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-01-11 14:22:39,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:39,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:22:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:39,382 INFO L225 Difference]: With dead ends: 86 [2019-01-11 14:22:39,383 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 14:22:39,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:22:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 14:22:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-01-11 14:22:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 14:22:39,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-01-11 14:22:39,404 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-01-11 14:22:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:39,405 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-01-11 14:22:39,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-01-11 14:22:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:39,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:39,406 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-11 14:22:39,406 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-01-11 14:22:39,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:39,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:39,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:22:39,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:39,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:39,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:39,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:39,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:39,525 INFO 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-11 14:22:39,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:22:39,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:22:39,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:22:39,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:39,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:39,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:39,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:39,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:39,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:39,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:39,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:39,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:39,697 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,711 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,728 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,746 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-11 14:22:39,746 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:39,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:39,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:39,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:39,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-11 14:22:39,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:39,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-11 14:22:39,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:39,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:39,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:39,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:39,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:22:39,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:39,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-11 14:22:39,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:22:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:39,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:40,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:40,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-11 14:22:40,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:40,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:40,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:22:40,007 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-01-11 14:22:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:40,493 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-01-11 14:22:40,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:22:40,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:22:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:40,495 INFO L225 Difference]: With dead ends: 96 [2019-01-11 14:22:40,495 INFO L226 Difference]: Without dead ends: 90 [2019-01-11 14:22:40,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:22:40,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-11 14:22:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-01-11 14:22:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 14:22:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-01-11 14:22:40,521 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-01-11 14:22:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:40,521 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-01-11 14:22:40,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:40,521 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-01-11 14:22:40,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:40,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:40,522 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:22:40,522 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:40,522 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-01-11 14:22:40,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:40,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:40,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:40,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:40,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:40,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:40,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:40,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:40,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:40,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:40,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:40,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:22:40,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:22:40,659 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:22:40,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:40,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:40,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:40,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:40,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:40,786 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:40,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:40,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:40,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:40,831 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,846 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:40,882 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:40,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:40,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:40,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:40,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:40,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-11 14:22:40,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:40,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:40,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-11 14:22:41,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:41,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:41,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:41,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:41,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:41,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-11 14:22:41,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:41,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:41,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-11 14:22:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:41,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:41,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:41,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:22:41,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:41,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:22:41,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:22:41,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:22:41,308 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-01-11 14:22:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:41,778 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-01-11 14:22:41,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:22:41,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:22:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:41,780 INFO L225 Difference]: With dead ends: 107 [2019-01-11 14:22:41,780 INFO L226 Difference]: Without dead ends: 106 [2019-01-11 14:22:41,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:22:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-11 14:22:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-01-11 14:22:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 14:22:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-01-11 14:22:41,806 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-01-11 14:22:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:41,806 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-01-11 14:22:41,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:22:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-01-11 14:22:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:41,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:41,807 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:22:41,807 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-01-11 14:22:41,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:41,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:41,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:41,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:41,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:42,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:42,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:42,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:42,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:42,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:42,118 INFO 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-11 14:22:42,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:42,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:42,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:42,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:42,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:42,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:42,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:42,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:42,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:42,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:42,284 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,294 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:42,322 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:42,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:42,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:42,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:42,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:42,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:42,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:42,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:22:42,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:42,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-01-11 14:22:42,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:42,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-11 14:22:42,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:42,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:42,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-11 14:22:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:42,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:22:42,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:42,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:22:42,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:22:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:22:42,610 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-01-11 14:22:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:43,017 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-01-11 14:22:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:22:43,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:22:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:43,019 INFO L225 Difference]: With dead ends: 116 [2019-01-11 14:22:43,019 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 14:22:43,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:22:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 14:22:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-01-11 14:22:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 14:22:43,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-01-11 14:22:43,041 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-01-11 14:22:43,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:43,042 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-01-11 14:22:43,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:22:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-01-11 14:22:43,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:43,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:43,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:43,043 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:43,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:43,043 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-11 14:22:43,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:43,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:43,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:43,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:43,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:43,101 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-11 14:22:43,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:43,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:43,102 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:22:43,102 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-11 14:22:43,104 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:43,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:43,109 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:43,109 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:43,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:43,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:43,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:43,110 INFO 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-11 14:22:43,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:43,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:43,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:43,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:43,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:43,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:43,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:43,169 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:43,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:43,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:43,305 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,314 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,322 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:43,340 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:43,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:43,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:43,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:43,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:43,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:43,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:43,448 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-11 14:22:43,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:43,485 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-11 14:22:43,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:43,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:22:43,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:43,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:43,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:43,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:22:43,504 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-01-11 14:22:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:43,772 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-01-11 14:22:43,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:43,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:22:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:43,773 INFO L225 Difference]: With dead ends: 72 [2019-01-11 14:22:43,774 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 14:22:43,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 14:22:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-01-11 14:22:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 14:22:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-01-11 14:22:43,797 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-01-11 14:22:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:43,798 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-01-11 14:22:43,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-01-11 14:22:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:43,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:43,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:43,799 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-11 14:22:43,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:43,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:43,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:43,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:43,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:43,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:43,856 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:22:43,857 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-11 14:22:43,858 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:43,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:43,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:43,860 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:43,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:43,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:43,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:43,861 INFO 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-11 14:22:43,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:43,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:43,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:43,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:43,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:43,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:43,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:43,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:43,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:43,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:43,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:44,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:44,021 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,038 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:44,056 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:44,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:44,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:44,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:44,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:44,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:44,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:44,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,184 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:44,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:22:44,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:44,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:22:44,248 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-11 14:22:44,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:44,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:22:44,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:44,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:44,291 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-01-11 14:22:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:44,642 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-01-11 14:22:44,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:22:44,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:22:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:44,643 INFO L225 Difference]: With dead ends: 77 [2019-01-11 14:22:44,643 INFO L226 Difference]: Without dead ends: 76 [2019-01-11 14:22:44,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:22:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-11 14:22:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-11 14:22:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 14:22:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-01-11 14:22:44,669 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-01-11 14:22:44,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:44,669 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-01-11 14:22:44,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-01-11 14:22:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:44,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:44,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:44,670 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-11 14:22:44,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:44,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:44,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:44,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:44,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:44,778 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:22:44,778 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-11 14:22:44,779 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:44,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:44,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:44,782 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:44,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:44,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:44,783 INFO 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-11 14:22:44,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:44,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:44,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:44,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:44,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:44,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:44,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:44,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:44,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:44,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:44,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:44,949 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,958 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,966 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:44,984 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:45,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:45,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:45,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:45,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:45,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,187 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:45,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:22:45,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:22:45,228 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-11 14:22:45,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:45,266 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-11 14:22:45,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:45,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:22:45,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:45,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:45,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:22:45,286 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-01-11 14:22:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:45,639 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-01-11 14:22:45,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:45,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:22:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:45,641 INFO L225 Difference]: With dead ends: 78 [2019-01-11 14:22:45,641 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 14:22:45,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:22:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 14:22:45,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-01-11 14:22:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 14:22:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-01-11 14:22:45,668 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-01-11 14:22:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:45,668 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-01-11 14:22:45,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-01-11 14:22:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:45,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:45,669 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:22:45,669 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:45,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:45,670 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-01-11 14:22:45,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:45,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:45,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:45,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:45,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:45,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:45,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:45,734 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:22:45,734 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-11 14:22:45,737 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:45,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:45,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:45,740 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:45,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:45,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:45,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:45,740 INFO 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-11 14:22:45,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:45,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:45,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:45,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:45,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:45,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:45,842 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:45,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:45,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:45,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:45,883 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,895 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,904 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,930 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:45,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:45,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:45,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:45,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:45,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:45,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:22:45,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:46,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:46,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:22:46,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:46,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:22:46,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,103 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:46,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-11 14:22:46,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:46,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:22:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:46,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:46,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:46,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:22:46,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:46,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:22:46,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:22:46,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:22:46,215 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-01-11 14:22:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:46,678 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-01-11 14:22:46,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:22:46,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:22:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:46,680 INFO L225 Difference]: With dead ends: 95 [2019-01-11 14:22:46,680 INFO L226 Difference]: Without dead ends: 90 [2019-01-11 14:22:46,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:22:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-11 14:22:46,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-01-11 14:22:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 14:22:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-01-11 14:22:46,713 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-01-11 14:22:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:46,714 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-01-11 14:22:46,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:22:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-01-11 14:22:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:46,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:46,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:46,715 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:46,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:46,715 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-11 14:22:46,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:46,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:46,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:46,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:46,841 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-11 14:22:46,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:46,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:46,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:22:46,842 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-11 14:22:46,843 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:46,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:46,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:46,848 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:46,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:46,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:46,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:46,849 INFO 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-11 14:22:46,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:46,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:46,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:46,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:46,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:46,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:46,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:46,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:46,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:46,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:46,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:47,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:47,041 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,159 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,166 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:47,185 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:47,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:47,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:47,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:47,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:47,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:22:47,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:47,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:47,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 14:22:47,336 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-11 14:22:47,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:47,370 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-11 14:22:47,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:47,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 14:22:47,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:47,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:22:47,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:22:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:47,391 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-01-11 14:22:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:48,272 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-01-11 14:22:48,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:48,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:22:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:48,274 INFO L225 Difference]: With dead ends: 90 [2019-01-11 14:22:48,274 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 14:22:48,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:22:48,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 14:22:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-01-11 14:22:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-11 14:22:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-01-11 14:22:48,316 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-01-11 14:22:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:48,317 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-01-11 14:22:48,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:22:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-01-11 14:22:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:48,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:48,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:48,317 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:48,318 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-11 14:22:48,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:48,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:48,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:48,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:48,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:48,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:48,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:48,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:22:48,396 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-11 14:22:48,399 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:48,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:48,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:48,402 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:48,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:48,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:48,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:48,403 INFO 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-11 14:22:48,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:48,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:48,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:48,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:48,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:48,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:48,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:22:48,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-11 14:22:48,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-11 14:22:48,535 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,540 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,553 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-11 14:22:48,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:22:48,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:22:48,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,608 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:48,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:22:48,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-11 14:22:48,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:48,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:22:48,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:48,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:48,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-11 14:22:48,679 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-11 14:22:48,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:48,706 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-11 14:22:48,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:48,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:22:48,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:48,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:48,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:48,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:48,725 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-01-11 14:22:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:49,042 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-01-11 14:22:49,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:22:49,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:22:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:49,045 INFO L225 Difference]: With dead ends: 122 [2019-01-11 14:22:49,045 INFO L226 Difference]: Without dead ends: 121 [2019-01-11 14:22:49,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:22:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-11 14:22:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-01-11 14:22:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 14:22:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-01-11 14:22:49,091 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-01-11 14:22:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:49,091 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-01-11 14:22:49,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-01-11 14:22:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:49,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:49,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:49,092 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-11 14:22:49,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:49,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:49,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:49,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:49,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:49,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:49,242 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:22:49,242 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-11 14:22:49,242 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:49,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:49,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:49,245 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:49,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:49,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:49,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:49,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:49,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:49,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:49,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:22:49,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:22:49,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:22:49,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:49,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:22:49,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-11 14:22:49,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-11 14:22:49,351 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,366 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,374 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:49,399 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-11 14:22:49,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:22:49,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:49,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:22:49,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:49,472 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:49,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-11 14:22:49,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:49,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:49,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 14:22:49,497 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-11 14:22:49,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:49,537 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-11 14:22:49,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:49,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:49,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:49,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:49,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:49,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:49,557 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-01-11 14:22:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:49,766 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-01-11 14:22:49,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:22:49,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:22:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:49,769 INFO L225 Difference]: With dead ends: 113 [2019-01-11 14:22:49,769 INFO L226 Difference]: Without dead ends: 108 [2019-01-11 14:22:49,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-11 14:22:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-01-11 14:22:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 14:22:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-01-11 14:22:49,829 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-01-11 14:22:49,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:49,829 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-01-11 14:22:49,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:49,829 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-01-11 14:22:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:49,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:49,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:49,830 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:49,831 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-11 14:22:49,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:49,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:49,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:49,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:49,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:49,989 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-11 14:22:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:50,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:50,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:50,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:50,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:50,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:50,006 INFO 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-11 14:22:50,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:50,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:50,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:22:50,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:50,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:50,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:50,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:50,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:50,113 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,121 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:50,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:50,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:50,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:50,172 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,220 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,315 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:50,341 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:50,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:50,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:50,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:50,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:50,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:50,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:50,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,447 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:50,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:50,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 71 [2019-01-11 14:22:50,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:50,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:50,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:22:50,494 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-11 14:22:50,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:50,528 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-11 14:22:50,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:50,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:22:50,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:50,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:22:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:22:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:50,548 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-01-11 14:22:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:50,899 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-01-11 14:22:50,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:22:50,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:22:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:50,902 INFO L225 Difference]: With dead ends: 137 [2019-01-11 14:22:50,902 INFO L226 Difference]: Without dead ends: 136 [2019-01-11 14:22:50,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:22:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-11 14:22:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-11 14:22:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 14:22:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-01-11 14:22:50,946 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-01-11 14:22:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:50,947 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-01-11 14:22:50,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:22:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-01-11 14:22:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:50,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:50,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:50,948 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:50,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:50,948 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-11 14:22:50,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:50,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:50,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:50,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:51,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:51,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:51,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:22:51,284 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-11 14:22:51,285 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:51,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:51,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:51,287 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:22:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:51,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:51,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:51,288 INFO 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-11 14:22:51,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:51,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:51,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:51,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-11 14:22:51,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-01-11 14:22:51,474 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 14:22:51,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-01-11 14:22:51,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:51,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:22:51,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-11 14:22:51,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:22:51,643 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,652 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,660 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,680 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-11 14:22:51,680 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-01-11 14:22:51,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:22:51,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-11 14:22:51,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:51,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:22:51,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:51,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:51,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-01-11 14:22:51,814 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-11 14:22:51,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:51,833 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-11 14:22:51,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:51,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:22:51,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:51,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:22:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:22:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:22:51,852 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-01-11 14:22:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:52,047 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-01-11 14:22:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:22:52,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:22:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:52,049 INFO L225 Difference]: With dead ends: 110 [2019-01-11 14:22:52,049 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 14:22:52,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:22:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 14:22:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-01-11 14:22:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-11 14:22:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-01-11 14:22:52,096 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-01-11 14:22:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:52,096 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-01-11 14:22:52,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:22:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-01-11 14:22:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:52,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:52,097 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:22:52,097 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:52,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:52,097 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-01-11 14:22:52,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:52,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:52,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:52,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:52,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:52,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:52,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:52,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:52,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:52,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:52,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:52,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:22:52,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:52,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:52,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:52,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:52,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:52,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:52,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:52,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:52,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:52,693 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,702 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,711 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,729 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:52,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:52,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:52,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:22:52,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 14:22:52,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,841 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:52,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-11 14:22:52,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-11 14:22:52,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:52,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:22:52,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:52,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:52,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:22:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:52,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:52,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:52,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 14:22:52,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:52,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:22:52,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:22:52,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:22:52,996 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-01-11 14:22:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:53,420 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-01-11 14:22:53,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:22:53,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:22:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:53,422 INFO L225 Difference]: With dead ends: 124 [2019-01-11 14:22:53,422 INFO L226 Difference]: Without dead ends: 116 [2019-01-11 14:22:53,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:22:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-11 14:22:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-01-11 14:22:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 14:22:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-01-11 14:22:53,473 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-01-11 14:22:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:53,474 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-01-11 14:22:53,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:22:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-01-11 14:22:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:53,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:53,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:53,475 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-01-11 14:22:53,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:53,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:53,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:53,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:53,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:53,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:53,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:22:53,624 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-11 14:22:53,625 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:53,625 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:53,627 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:53,628 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:22:53,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:53,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:53,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:53,628 INFO 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-11 14:22:53,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:53,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:53,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:53,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:53,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:53,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:53,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:53,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,707 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:53,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:53,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:53,824 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,834 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,842 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,861 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:53,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:53,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:53,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:53,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:22:53,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:53,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 14:22:53,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,975 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:53,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:53,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-11 14:22:53,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:53,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:53,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:22:54,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:54,028 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:54,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:22:54,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:54,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 14:22:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:54,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:54,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:54,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:22:54,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:54,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:22:54,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:22:54,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:22:54,134 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-01-11 14:22:54,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:54,652 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-01-11 14:22:54,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:22:54,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:22:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:54,654 INFO L225 Difference]: With dead ends: 137 [2019-01-11 14:22:54,654 INFO L226 Difference]: Without dead ends: 136 [2019-01-11 14:22:54,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:22:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-11 14:22:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-01-11 14:22:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 14:22:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-01-11 14:22:54,714 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-01-11 14:22:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:54,714 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-01-11 14:22:54,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:22:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-01-11 14:22:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:54,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:54,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:54,715 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-01-11 14:22:54,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:54,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:54,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:54,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:54,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:54,942 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-11 14:22:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:55,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:55,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:55,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:55,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:55,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:55,104 INFO 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-11 14:22:55,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:55,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:55,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:22:55,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:55,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:55,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:55,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:55,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:55,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:55,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:55,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:55,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:55,306 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,315 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,323 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,341 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:55,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:55,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:55,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:55,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,426 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:55,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:22:55,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:55,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-11 14:22:55,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:22:55,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:55,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-11 14:22:55,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,520 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:55,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:55,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:22:55,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:55,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:55,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-11 14:22:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:55,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:55,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:55,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:22:55,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:55,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:22:55,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:22:55,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:22:55,640 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-01-11 14:22:56,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:56,249 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-01-11 14:22:56,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:22:56,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:22:56,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:56,252 INFO L225 Difference]: With dead ends: 172 [2019-01-11 14:22:56,252 INFO L226 Difference]: Without dead ends: 167 [2019-01-11 14:22:56,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:22:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-11 14:22:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-01-11 14:22:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-11 14:22:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-01-11 14:22:56,309 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-01-11 14:22:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:56,309 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-01-11 14:22:56,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:22:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-01-11 14:22:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:22:56,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:56,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:22:56,310 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:56,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:56,310 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-01-11 14:22:56,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:56,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:56,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:56,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:56,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:56,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:56,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:56,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:56,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:56,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:56,465 INFO 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-11 14:22:56,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:22:56,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:22:56,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:22:56,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:56,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:56,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:56,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:56,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:56,589 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,599 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:56,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:56,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:56,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:56,631 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,646 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,655 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,662 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,680 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:56,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:22:56,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:56,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:56,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,750 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:56,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:22:56,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:56,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-11 14:22:56,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:22:56,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:56,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-11 14:22:56,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:56,876 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:56,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:22:56,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:56,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:56,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-01-11 14:22:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:56,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:56,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:56,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:22:56,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:56,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:22:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:22:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:22:56,984 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-01-11 14:22:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:57,441 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-01-11 14:22:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:22:57,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:22:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:57,443 INFO L225 Difference]: With dead ends: 140 [2019-01-11 14:22:57,443 INFO L226 Difference]: Without dead ends: 135 [2019-01-11 14:22:57,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:22:57,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-11 14:22:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-01-11 14:22:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 14:22:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-01-11 14:22:57,501 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-01-11 14:22:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:57,501 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-01-11 14:22:57,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:22:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-01-11 14:22:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:22:57,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:57,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:22:57,502 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:57,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-11 14:22:57,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:57,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:57,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:57,763 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-11 14:22:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:57,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:57,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:57,886 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:22:57,886 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-11 14:22:57,887 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:57,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:57,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:57,890 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:22:57,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:57,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:57,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:57,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:57,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:57,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:57,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:57,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:57,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:57,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:57,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:57,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:57,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:57,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:57,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:57,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:58,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:58,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:58,069 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,078 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,106 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:58,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:58,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:58,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:58,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:58,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:58,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:58,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,237 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:58,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:58,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:22:58,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:58,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:58,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 14:22:58,279 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-11 14:22:58,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:58,313 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-11 14:22:58,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:58,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:22:58,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:58,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:22:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:22:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:22:58,333 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-01-11 14:22:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:58,773 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-01-11 14:22:58,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:22:58,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:22:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:58,775 INFO L225 Difference]: With dead ends: 77 [2019-01-11 14:22:58,775 INFO L226 Difference]: Without dead ends: 76 [2019-01-11 14:22:58,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:22:58,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-11 14:22:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-01-11 14:22:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-11 14:22:58,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-01-11 14:22:58,833 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-01-11 14:22:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:58,833 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-01-11 14:22:58,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:22:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-01-11 14:22:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:22:58,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:58,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:22:58,834 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:22:58,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-11 14:22:58,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:58,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:58,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:22:58,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:58,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:58,932 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:22:58,933 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-11 14:22:58,936 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:22:58,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:22:58,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:22:58,939 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:22:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:58,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:22:58,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:58,940 INFO 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-11 14:22:58,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:58,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:58,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:58,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:22:58,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:22:59,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:22:59,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:22:59,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:22:59,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:22:59,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:22:59,134 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,144 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,153 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,172 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:22:59,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:22:59,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:59,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:22:59,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:22:59,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:59,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:22:59,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:59,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:22:59,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:59,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:22:59,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,337 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:22:59,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:22:59,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:22:59,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:59,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:22:59,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-11 14:22:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:59,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:59,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:59,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:22:59,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:59,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:22:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:22:59,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:22:59,445 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-01-11 14:22:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:59,979 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-01-11 14:22:59,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:22:59,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:22:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:59,981 INFO L225 Difference]: With dead ends: 86 [2019-01-11 14:22:59,981 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 14:22:59,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:22:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 14:23:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-01-11 14:23:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 14:23:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-01-11 14:23:00,046 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-01-11 14:23:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:00,046 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-01-11 14:23:00,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-01-11 14:23:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:00,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:00,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:00,046 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-01-11 14:23:00,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:00,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:00,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:00,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:00,256 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:00,256 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-01-11 14:23:00,257 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:00,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:00,260 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:00,260 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:00,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:00,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:00,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,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 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-11 14:23:00,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:00,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:00,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:00,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:00,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:23:00,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-11 14:23:00,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-01-11 14:23:00,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,310 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:00,328 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-01-11 14:23:00,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 14:23:00,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:00,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 14:23:00,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-01-11 14:23:00,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-11 14:23:00,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,406 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:00,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-01-11 14:23:00,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:00,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-01-11 14:23:00,434 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-11 14:23:00,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:00,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:23:00,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-01-11 14:23:00,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:00,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:23:00,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:23:00,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:00,467 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-01-11 14:23:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:00,687 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-01-11 14:23:00,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:23:00,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-11 14:23:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:00,689 INFO L225 Difference]: With dead ends: 115 [2019-01-11 14:23:00,689 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 14:23:00,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 14:23:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-01-11 14:23:00,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 14:23:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-01-11 14:23:00,793 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-01-11 14:23:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:00,793 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-01-11 14:23:00,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:23:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-01-11 14:23:00,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:00,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:00,794 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:00,794 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:00,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:00,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-11 14:23:00,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:00,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:00,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:00,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:00,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:00,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:00,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:00,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:00,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:23:00,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:00,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:00,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:00,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:00,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:00,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:00,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:23:00,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:23:00,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:00,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:23:00,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,986 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:00,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:01,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:01,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:01,073 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,083 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,090 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,107 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:23:01,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:01,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:01,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,175 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:01,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:23:01,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-11 14:23:01,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:23:01,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 14:23:01,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:01,269 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:01,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:23:01,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:01,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:01,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 14:23:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:01,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:01,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:01,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:23:01,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:01,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:23:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:23:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:01,381 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-01-11 14:23:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:01,973 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-01-11 14:23:01,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:23:01,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:23:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:01,975 INFO L225 Difference]: With dead ends: 104 [2019-01-11 14:23:01,976 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 14:23:01,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:23:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 14:23:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-01-11 14:23:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 14:23:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-01-11 14:23:02,047 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-01-11 14:23:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:02,048 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-01-11 14:23:02,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:23:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-01-11 14:23:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:02,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:02,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:02,048 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:02,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:02,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-01-11 14:23:02,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:02,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:02,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:02,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:02,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:02,109 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-11 14:23:02,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:02,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:02,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:02,110 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-11 14:23:02,110 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:02,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:02,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:02,113 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:02,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:02,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:02,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:02,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:02,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:02,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:02,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:02,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:23:02,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-11 14:23:02,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-11 14:23:02,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:23:02,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:23:02,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:23:02,253 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,261 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,270 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:02,285 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-11 14:23:02,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:23:02,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:02,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:23:02,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:23:02,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:02,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-11 14:23:02,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,375 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:02,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:02,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-01-11 14:23:02,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:02,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:02,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-01-11 14:23:02,406 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-11 14:23:02,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:02,440 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-11 14:23:02,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:02,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:02,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:02,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:02,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:02,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:02,461 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-01-11 14:23:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:02,880 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-01-11 14:23:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:02,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:23:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:02,882 INFO L225 Difference]: With dead ends: 68 [2019-01-11 14:23:02,882 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 14:23:02,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 14:23:02,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-01-11 14:23:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-11 14:23:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-01-11 14:23:02,976 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-01-11 14:23:02,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:02,976 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-01-11 14:23:02,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-01-11 14:23:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:02,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:02,976 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 14:23:02,977 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-01-11 14:23:02,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:02,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:02,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:02,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:23:03,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:23:03,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:23:03,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:03,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:23:03,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:23:03,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:23:03,019 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-01-11 14:23:03,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:03,136 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-01-11 14:23:03,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:23:03,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-11 14:23:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:03,137 INFO L225 Difference]: With dead ends: 54 [2019-01-11 14:23:03,137 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 14:23:03,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:23:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 14:23:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-11 14:23:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-11 14:23:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-01-11 14:23:03,225 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-01-11 14:23:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:03,225 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-01-11 14:23:03,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:23:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-01-11 14:23:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:03,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:03,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:03,226 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:03,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:03,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-11 14:23:03,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:03,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:03,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:03,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:03,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:03,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:03,308 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-11 14:23:03,309 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:03,309 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:03,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:03,312 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:03,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:03,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:03,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:03,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:03,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:03,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:03,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:03,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:03,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:03,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:03,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:23:03,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:23:03,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:23:03,480 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,738 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,776 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:03,801 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:23:03,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:03,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:03,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:03,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:03,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:03,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,012 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:04,012 INFO L303 Elim1Store]: Index analysis took 150 ms [2019-01-11 14:23:04,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:23:04,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:04,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 14:23:04,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:23:04,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:04,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-11 14:23:04,119 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-11 14:23:04,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:04,145 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-11 14:23:04,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:04,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:04,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:04,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:04,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:04,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:04,166 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-01-11 14:23:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:04,564 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-01-11 14:23:04,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:23:04,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:23:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:04,566 INFO L225 Difference]: With dead ends: 78 [2019-01-11 14:23:04,566 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 14:23:04,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 14:23:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-01-11 14:23:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 14:23:04,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-01-11 14:23:04,674 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-01-11 14:23:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:04,674 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-01-11 14:23:04,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-01-11 14:23:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:04,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:04,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:04,675 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-01-11 14:23:04,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:04,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:04,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:04,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:04,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:04,820 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-11 14:23:04,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:04,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:04,821 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:04,821 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-11 14:23:04,822 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:04,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:04,824 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:04,824 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:04,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:04,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:04,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:04,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:04,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:04,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:04,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:04,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:04,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:04,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:23:04,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:23:04,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:23:04,959 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,974 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:04,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:05,007 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:23:05,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:05,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:05,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:05,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:23:05,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:05,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 14:23:05,121 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-11 14:23:05,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:05,137 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-11 14:23:05,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:05,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:05,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:05,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:05,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:05,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:05,156 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-01-11 14:23:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:05,615 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-01-11 14:23:05,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:05,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:23:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:05,616 INFO L225 Difference]: With dead ends: 64 [2019-01-11 14:23:05,617 INFO L226 Difference]: Without dead ends: 56 [2019-01-11 14:23:05,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-11 14:23:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-11 14:23:05,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-11 14:23:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-01-11 14:23:05,719 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-01-11 14:23:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:05,719 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-01-11 14:23:05,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-01-11 14:23:05,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:05,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:05,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:05,720 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-11 14:23:05,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:05,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:05,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:05,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:05,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:05,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:05,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:05,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:05,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:05,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:05,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:05,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:05,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:05,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:05,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:05,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:05,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:23:05,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:23:05,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:23:05,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,897 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:05,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:23:05,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-11 14:23:05,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-11 14:23:05,942 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,955 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,969 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:05,986 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-11 14:23:06,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:23:06,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:06,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 14:23:06,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:23:06,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:06,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-11 14:23:06,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,083 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:06,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-01-11 14:23:06,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:06,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-11 14:23:06,112 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-11 14:23:06,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:06,152 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-11 14:23:06,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:06,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:06,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:06,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:06,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:06,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:06,172 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-01-11 14:23:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:06,656 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-01-11 14:23:06,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:06,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:23:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:06,658 INFO L225 Difference]: With dead ends: 76 [2019-01-11 14:23:06,658 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 14:23:06,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 14:23:06,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-01-11 14:23:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 14:23:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-01-11 14:23:06,775 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-01-11 14:23:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:06,776 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-01-11 14:23:06,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-01-11 14:23:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:23:06,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:06,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:06,776 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-01-11 14:23:06,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:06,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:06,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:06,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:06,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:06,888 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-11 14:23:06,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:06,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:06,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:23:06,889 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-01-11 14:23:06,890 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:06,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:06,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:06,892 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:06,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:06,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:06,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:06,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:06,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:06,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:06,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-11 14:23:06,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-01-11 14:23:06,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-01-11 14:23:06,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:06,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:23:06,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-11 14:23:06,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:23:06,972 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,984 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,992 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,000 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:07,013 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-11 14:23:07,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:23:07,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:07,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:07,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-11 14:23:07,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,128 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:07,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:23:07,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-11 14:23:07,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,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 2 xjuncts. [2019-01-11 14:23:07,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-11 14:23:07,205 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-11 14:23:07,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:07,221 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-11 14:23:07,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:07,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-11 14:23:07,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:07,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:07,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:07,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:07,241 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-01-11 14:23:07,871 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-01-11 14:23:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:08,398 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-01-11 14:23:08,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:23:08,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:23:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:08,399 INFO L225 Difference]: With dead ends: 90 [2019-01-11 14:23:08,400 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 14:23:08,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:23:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 14:23:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-01-11 14:23:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 14:23:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-01-11 14:23:08,599 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-01-11 14:23:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:08,600 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-01-11 14:23:08,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-01-11 14:23:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:23:08,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:08,600 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:08,600 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-01-11 14:23:08,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:08,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:08,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:08,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:08,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:08,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:08,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:08,773 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:23:08,773 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-11 14:23:08,775 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:08,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:08,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:08,778 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:08,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:08,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:08,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:08,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:08,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:08,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:08,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:08,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:08,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:23:08,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:23:08,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:23:08,838 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:08,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:08,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:08,953 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,963 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,972 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,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-11 14:23:08,990 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-11 14:23:09,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:09,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:09,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:09,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:23:09,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:09,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:23:09,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-11 14:23:09,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:09,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:23:09,144 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-11 14:23:09,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:09,175 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-11 14:23:09,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:09,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 14:23:09,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:09,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:23:09,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:23:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:09,196 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-01-11 14:23:09,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:09,871 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-01-11 14:23:09,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:23:09,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 14:23:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:09,873 INFO L225 Difference]: With dead ends: 118 [2019-01-11 14:23:09,873 INFO L226 Difference]: Without dead ends: 106 [2019-01-11 14:23:09,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:23:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-11 14:23:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-01-11 14:23:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-11 14:23:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-01-11 14:23:10,096 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-01-11 14:23:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:10,096 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-01-11 14:23:10,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:23:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-01-11 14:23:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:23:10,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:10,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:10,097 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-01-11 14:23:10,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:10,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:10,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:10,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:10,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:10,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:10,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:10,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:10,242 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:23:10,242 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-01-11 14:23:10,247 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:10,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:10,249 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:10,249 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:23:10,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:10,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:10,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:10,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:10,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:10,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:10,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:10,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:10,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:23:10,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:23:10,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:23:10,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:10,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:10,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:10,421 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,429 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,457 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:23:10,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:10,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:10,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:10,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:23:10,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:10,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:23:10,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,713 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:10,713 INFO L303 Elim1Store]: Index analysis took 137 ms [2019-01-11 14:23:10,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:23:10,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:10,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-11 14:23:10,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,765 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:10,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:23:10,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:10,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-11 14:23:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:10,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:10,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:10,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 14:23:10,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:10,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:23:10,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:23:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:10,874 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-01-11 14:23:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:11,722 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-01-11 14:23:11,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:23:11,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-11 14:23:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:11,723 INFO L225 Difference]: With dead ends: 124 [2019-01-11 14:23:11,724 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 14:23:11,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:23:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 14:23:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-01-11 14:23:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 14:23:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-01-11 14:23:12,035 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-01-11 14:23:12,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:12,035 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-01-11 14:23:12,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:23:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-01-11 14:23:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:23:12,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:12,036 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:12,036 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:12,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:12,036 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-01-11 14:23:12,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:12,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:12,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:12,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:12,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:23:12,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:12,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:12,105 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 14:23:12,106 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-01-11 14:23:12,107 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:12,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:12,108 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:12,109 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 14:23:12,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:12,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:12,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:12,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:12,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:12,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:12,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:12,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:12,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:23:12,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-11 14:23:12,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-11 14:23:12,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,169 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-01-11 14:23:12,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-01-11 14:23:12,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-01-11 14:23:12,204 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,210 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:12,228 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-11 14:23:12,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 14:23:12,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:12,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 14:23:12,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-11 14:23:12,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:12,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-11 14:23:12,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:12,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-01-11 14:23:12,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 14:23:12,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-11 14:23:12,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:12,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-01-11 14:23:12,466 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-11 14:23:12,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:12,500 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-11 14:23:12,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:12,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:23:12,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:12,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:23:12,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:23:12,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:12,520 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-01-11 14:23:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:13,165 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-01-11 14:23:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:13,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 14:23:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:13,167 INFO L225 Difference]: With dead ends: 87 [2019-01-11 14:23:13,167 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 14:23:13,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 14:23:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-11 14:23:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 14:23:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-01-11 14:23:13,481 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-01-11 14:23:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:13,482 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-01-11 14:23:13,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:23:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-01-11 14:23:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:23:13,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:13,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:13,483 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-01-11 14:23:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:13,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:13,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:13,633 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:23:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:23:13,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:13,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:13,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:13,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:13,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:13,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:13,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:13,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:13,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:13,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:13,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:13,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:13,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-11 14:23:13,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-01-11 14:23:13,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-01-11 14:23:13,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 14:23:13,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 14:23:13,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 14:23:13,838 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,846 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,855 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,871 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-01-11 14:23:13,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:13,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:13,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:13,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-01-11 14:23:14,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 14:23:14,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,108 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:14,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2019-01-11 14:23:14,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:14,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-01-11 14:23:14,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,184 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:14,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-01-11 14:23:14,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-01-11 14:23:14,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:14,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-01-11 14:23:14,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-01-11 14:23:14,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,336 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:14,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-11 14:23:14,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:14,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-01-11 14:23:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:14,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:14,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:14,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 14:23:14,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:14,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:23:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:23:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:14,470 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-01-11 14:23:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:15,737 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-01-11 14:23:15,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:23:15,738 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-11 14:23:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:15,740 INFO L225 Difference]: With dead ends: 186 [2019-01-11 14:23:15,740 INFO L226 Difference]: Without dead ends: 177 [2019-01-11 14:23:15,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:23:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-11 14:23:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-01-11 14:23:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 14:23:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-01-11 14:23:16,137 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-01-11 14:23:16,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:16,137 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-01-11 14:23:16,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:23:16,137 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-01-11 14:23:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:23:16,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:16,138 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:16,138 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:16,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-01-11 14:23:16,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:16,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:16,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:23:16,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:16,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:16,254 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 14:23:16,254 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-11 14:23:16,256 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:16,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:16,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:16,258 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:23:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:16,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:16,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:16,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:16,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:16,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:16,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:16,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:16,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:16,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:16,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,364 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:16,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:23:16,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:23:16,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:23:16,398 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,411 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,420 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:16,445 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-11 14:23:16,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:23:16,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:16,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:16,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 14:23:16,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:16,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 14:23:16,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,555 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:16,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:23:16,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:16,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-11 14:23:16,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 89 [2019-01-11 14:23:16,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:16,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-11 14:23:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:16,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:16,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:16,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:23:16,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:16,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:23:16,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:23:16,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:16,718 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-01-11 14:23:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:17,465 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-01-11 14:23:17,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:23:17,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 14:23:17,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:17,470 INFO L225 Difference]: With dead ends: 110 [2019-01-11 14:23:17,470 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 14:23:17,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:23:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 14:23:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-01-11 14:23:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 14:23:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-11 14:23:17,579 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-01-11 14:23:17,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:17,579 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-11 14:23:17,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:23:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-11 14:23:17,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 14:23:17,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:17,580 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:23:17,580 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:17,581 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-01-11 14:23:17,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:17,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:17,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:17,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:17,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-11 14:23:17,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:17,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:17,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:17,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:17,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:17,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:17,694 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:23:17,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:23:17,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:23:17,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:17,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:17,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 14:23:17,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 14:23:17,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-11 14:23:17,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-11 14:23:17,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-11 14:23:17,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-11 14:23:17,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-11 14:23:17,837 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,851 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,860 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,886 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-11 14:23:17,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:23:17,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:17,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:23:17,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:23:17,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:18,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-01-11 14:23:18,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,074 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:18,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:23:18,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:18,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-01-11 14:23:18,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,170 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:18,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-11 14:23:18,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:18,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-01-11 14:23:18,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 59 [2019-01-11 14:23:18,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:18,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-01-11 14:23:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:18,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:18,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:18,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 14:23:18,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:18,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:23:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:23:18,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:23:18,372 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-01-11 14:23:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:18,836 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-01-11 14:23:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:23:18,837 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-11 14:23:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:18,838 INFO L225 Difference]: With dead ends: 32 [2019-01-11 14:23:18,838 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:23:18,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:23:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:23:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:23:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:23:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:23:18,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-01-11 14:23:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:18,840 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:23:18,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:23:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:23:18,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:23:18,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:23:18,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:18,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:18,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:18,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:19,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:19,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:19,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:19,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:19,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:19,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:19,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:20,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:20,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:20,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:23,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:23,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:24,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:24,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:24,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:24,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:27,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 14:23:29,817 WARN L181 SmtUtils]: Spent 10.97 s on a formula simplification. DAG size of input: 1499 DAG size of output: 1055 [2019-01-11 14:23:45,401 WARN L181 SmtUtils]: Spent 15.57 s on a formula simplification. DAG size of input: 993 DAG size of output: 79 [2019-01-11 14:23:45,405 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:23:45,405 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-11 14:23:45,405 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-11 14:23:45,406 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-01-11 14:23:45,406 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse5 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse11 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse21 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse5 (- 1)))) (.cse7 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse22 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse7 1))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse18 (select .cse21 ULTIMATE.start_main_p1)) (.cse19 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse11 1)))) (let ((.cse3 (<= (+ (select .cse19 ULTIMATE.start_main_p4) 1) 0)) (.cse9 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse1 (<= 1 .cse18)) (.cse8 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse14 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse6 (- 1)))) (.cse2 (= 0 (select .cse21 ULTIMATE.start_main_p2))) (.cse4 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse12 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse13 (= 0 (select .cse22 ULTIMATE.start_main_p1))) (.cse10 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse15 (= 0 (select .cse22 ULTIMATE.start_main_p2))) (.cse0 (select .cse21 ULTIMATE.start_main_p3))) (or (and (and (= 0 .cse0) .cse1 .cse2 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) .cse3) (and .cse4 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse5 0) (<= .cse6 0) (= .cse7 0) .cse8 .cse9 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse10 (<= 0 .cse11)) (and (and .cse12 .cse13 (= 0 (select .cse14 ULTIMATE.start_main_p3)) .cse15) .cse3) (and (<= .cse5 0) (or (and .cse9 (let ((.cse16 (<= 0 .cse7)) (.cse17 (<= (+ (select .cse19 ULTIMATE.start_main_p2) 1) 0))) (or (and .cse16 .cse1 .cse17) (and .cse16 .cse17 (= 0 .cse18) .cse8)))) (let ((.cse20 (<= 1 .cse0))) (or (and (<= 1 (select .cse14 ULTIMATE.start_main_p1)) .cse2 .cse20) (and .cse4 .cse12 .cse13 .cse10 .cse15 .cse20)))))))))) [2019-01-11 14:23:45,406 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-11 14:23:45,406 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-11 14:23:45,406 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-01-11 14:23:45,406 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-11 14:23:45,406 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-01-11 14:23:45,406 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-11 14:23:45,422 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:23:45 BoogieIcfgContainer [2019-01-11 14:23:45,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:23:45,423 INFO L168 Benchmark]: Toolchain (without parser) took 91547.90 ms. Allocated memory was 140.5 MB in the beginning and 987.8 MB in the end (delta: 847.2 MB). Free memory was 108.0 MB in the beginning and 748.5 MB in the end (delta: -640.5 MB). Peak memory consumption was 835.0 MB. Max. memory is 7.1 GB. [2019-01-11 14:23:45,423 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:23:45,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.63 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 105.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:23:45,424 INFO L168 Benchmark]: Boogie Preprocessor took 22.51 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 14:23:45,424 INFO L168 Benchmark]: RCFGBuilder took 365.61 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 94.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:23:45,424 INFO L168 Benchmark]: TraceAbstraction took 91105.07 ms. Allocated memory was 140.5 MB in the beginning and 987.8 MB in the end (delta: 847.2 MB). Free memory was 93.7 MB in the beginning and 748.5 MB in the end (delta: -654.8 MB). Peak memory consumption was 820.7 MB. Max. memory is 7.1 GB. [2019-01-11 14:23:45,426 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.20 ms. Allocated memory is still 140.5 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.63 ms. Allocated memory is still 140.5 MB. Free memory was 107.8 MB in the beginning and 105.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.51 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 365.61 ms. Allocated memory is still 140.5 MB. Free memory was 104.4 MB in the beginning and 94.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 91105.07 ms. Allocated memory was 140.5 MB in the beginning and 987.8 MB in the end (delta: 847.2 MB). Free memory was 93.7 MB in the beginning and 748.5 MB in the end (delta: -654.8 MB). Peak memory consumption was 820.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || (((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1])) || ((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (#memory_int[p4] <= 0 && ((!(p3 == p4) && (((0 <= #memory_int[p3] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) || (((0 <= #memory_int[p3] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3)))) || ((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) || (((((!(p1 == p4) && !(p1 == p2)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 91.0s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 24.3s AutomataDifference, 0.0s DeadEndRemovalTime, 26.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 326 HoareAnnotationTreeSize, 1 FomulaSimplifications, 3998314872 FormulaSimplificationTreeSizeReduction, 10.9s HoareSimplificationTime, 1 FomulaSimplificationsInter, 84173104 FormulaSimplificationTreeSizeReductionInter, 15.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 33.9s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91495 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...