java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 18:07:43,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 18:07:43,741 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 18:07:43,754 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 18:07:43,754 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 18:07:43,755 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 18:07:43,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 18:07:43,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 18:07:43,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 18:07:43,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 18:07:43,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 18:07:43,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 18:07:43,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 18:07:43,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 18:07:43,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 18:07:43,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 18:07:43,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 18:07:43,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 18:07:43,773 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 18:07:43,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 18:07:43,776 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 18:07:43,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 18:07:43,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 18:07:43,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 18:07:43,781 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 18:07:43,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 18:07:43,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 18:07:43,784 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 18:07:43,785 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 18:07:43,786 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 18:07:43,786 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 18:07:43,787 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 18:07:43,787 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 18:07:43,787 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 18:07:43,788 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 18:07:43,789 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 18:07:43,789 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-18 18:07:43,803 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 18:07:43,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 18:07:43,804 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 18:07:43,804 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 18:07:43,804 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 18:07:43,805 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 18:07:43,805 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 18:07:43,805 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 18:07:43,805 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 18:07:43,805 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 18:07:43,806 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 18:07:43,806 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 18:07:43,806 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 18:07:43,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 18:07:43,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 18:07:43,807 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 18:07:43,808 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 18:07:43,808 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 18:07:43,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 18:07:43,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 18:07:43,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 18:07:43,809 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 18:07:43,809 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 18:07:43,809 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 18:07:43,809 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 18:07:43,809 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 18:07:43,810 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 18:07:43,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 18:07:43,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 18:07:43,810 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 18:07:43,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 18:07:43,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 18:07:43,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 18:07:43,811 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 18:07:43,811 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 18:07:43,812 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 18:07:43,812 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 18:07:43,812 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 18:07:43,812 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 18:07:43,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 18:07:43,857 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 18:07:43,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 18:07:43,863 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 18:07:43,863 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 18:07:43,864 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-18 18:07:43,864 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-01-18 18:07:43,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 18:07:43,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 18:07:43,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:43,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 18:07:43,909 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 18:07:43,927 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 18.01 06:07:43" (1/1) ... [2019-01-18 18:07:43,940 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 18.01 06:07:43" (1/1) ... [2019-01-18 18:07:43,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:43,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 18:07:43,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 18:07:43,970 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 18:07:43,984 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 18.01 06:07:43" (1/1) ... [2019-01-18 18:07:43,984 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 18.01 06:07:43" (1/1) ... [2019-01-18 18:07:43,986 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 18.01 06:07:43" (1/1) ... [2019-01-18 18:07:43,986 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 18.01 06:07:43" (1/1) ... [2019-01-18 18:07:43,990 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 18.01 06:07:43" (1/1) ... [2019-01-18 18:07:43,994 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 18.01 06:07:43" (1/1) ... [2019-01-18 18:07:43,997 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 18.01 06:07:43" (1/1) ... [2019-01-18 18:07:43,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 18:07:43,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 18:07:43,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 18:07:43,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 18:07:44,006 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 18.01 06:07:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 18:07:44,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 18:07:44,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 18:07:44,336 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 18:07:44,337 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-18 18:07:44,338 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:07:44 BoogieIcfgContainer [2019-01-18 18:07:44,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 18:07:44,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 18:07:44,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 18:07:44,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 18:07:44,343 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 18.01 06:07:43" (1/2) ... [2019-01-18 18:07:44,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f52ea3 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 06:07:44, skipping insertion in model container [2019-01-18 18:07:44,344 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 18.01 06:07:44" (2/2) ... [2019-01-18 18:07:44,346 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-01-18 18:07:44,356 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 18:07:44,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-18 18:07:44,383 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-18 18:07:44,422 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 18:07:44,422 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 18:07:44,422 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 18:07:44,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 18:07:44,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 18:07:44,423 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 18:07:44,423 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 18:07:44,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 18:07:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-18 18:07:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 18:07:44,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:44,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 18:07:44,459 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:44,467 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-18 18:07:44,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:44,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:44,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:44,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:44,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:44,681 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-18 18:07:44,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:07:44,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:07:44,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:44,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:07:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:07:44,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:07:44,700 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-18 18:07:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:44,915 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-18 18:07:44,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:07:44,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 18:07:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:44,931 INFO L225 Difference]: With dead ends: 21 [2019-01-18 18:07:44,931 INFO L226 Difference]: Without dead ends: 16 [2019-01-18 18:07:44,935 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-18 18:07:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-18 18:07:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-18 18:07:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 18:07:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-18 18:07:44,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-18 18:07:44,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:44,971 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-18 18:07:44,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:07:44,971 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-18 18:07:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:44,972 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:44,972 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:44,973 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-18 18:07:44,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:44,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:44,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:44,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:45,083 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-18 18:07:45,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:45,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:45,085 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:07:45,087 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-18 18:07:45,148 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:45,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:48,903 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:07:48,904 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:07:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:48,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:07:48,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:48,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:07:48,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:48,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:07:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:48,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:49,095 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-18 18:07:49,111 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-18 18:07:49,127 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-18 18:07:49,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 18:07:49,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:07:49,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:49,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:49,576 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:49,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:49,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:07:49,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,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, 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-18 18:07:49,920 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-18 18:07:49,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:49,984 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-18 18:07:49,985 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:50,011 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:50,025 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:50,072 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-18 18:07:50,073 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-18 18:07:50,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:50,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, 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-18 18:07:50,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:50,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:07:50,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 18:07:50,234 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-18 18:07:50,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:50,264 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-18 18:07:50,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:07:50,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 18:07:50,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:07:50,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 18:07:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 18:07:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:07:50,289 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-18 18:07:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:50,809 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-18 18:07:50,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:07:50,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 18:07:50,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:50,812 INFO L225 Difference]: With dead ends: 31 [2019-01-18 18:07:50,812 INFO L226 Difference]: Without dead ends: 28 [2019-01-18 18:07:50,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:07:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-18 18:07:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-18 18:07:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 18:07:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-18 18:07:50,819 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-18 18:07:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:50,819 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-18 18:07:50,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 18:07:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-18 18:07:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:50,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:50,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:50,820 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:50,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:50,821 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-18 18:07:50,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:50,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:50,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:50,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:50,861 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-18 18:07:50,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:07:50,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:07:50,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:50,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:07:50,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:07:50,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:07:50,862 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-18 18:07:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:50,908 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-18 18:07:50,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:07:50,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 18:07:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:50,910 INFO L225 Difference]: With dead ends: 15 [2019-01-18 18:07:50,911 INFO L226 Difference]: Without dead ends: 14 [2019-01-18 18:07:50,911 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-18 18:07:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-18 18:07:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-18 18:07:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 18:07:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-18 18:07:50,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-18 18:07:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:50,917 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-18 18:07:50,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:07:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-18 18:07:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:50,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:50,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:50,918 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:50,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:50,919 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-18 18:07:50,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:50,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:50,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:50,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:50,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:51,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:51,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:51,026 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:07:51,026 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-18 18:07:51,029 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:51,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:51,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:07:51,337 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:07:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:51,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:07:51,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:51,338 INFO 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-18 18:07:51,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:51,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:07:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:51,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:51,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:07:51,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-18 18:07:51,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:51,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:51,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 18:07:51,508 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-18 18:07:51,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:51,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:51,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:51,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:51,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:51,612 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-18 18:07:51,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:51,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:51,641 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-18 18:07:51,642 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:51,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:51,673 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-18 18:07:51,674 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-01-18 18:07:51,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:51,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 18:07:51,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:51,758 INFO L267 ElimStorePlain]: Start 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-18 18:07:51,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-18 18:07:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:51,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:51,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:07:51,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-18 18:07:51,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:51,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:07:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:07:51,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:07:51,808 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-18 18:07:51,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:51,927 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-18 18:07:51,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:07:51,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:07:51,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:51,928 INFO L225 Difference]: With dead ends: 18 [2019-01-18 18:07:51,929 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 18:07:51,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:07:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 18:07:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-18 18:07:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 18:07:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-18 18:07:51,938 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-18 18:07:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:51,938 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-18 18:07:51,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:07:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-18 18:07:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:51,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:51,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:51,939 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:51,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:51,941 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-18 18:07:51,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:51,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:51,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:51,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:51,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:51,998 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-18 18:07:51,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:51,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:51,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:07:51,999 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-18 18:07:52,003 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:52,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:52,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:07:52,255 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:07:52,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:52,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:07:52,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:52,256 INFO 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-18 18:07:52,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:52,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:07:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:52,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:52,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:52,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:07:52,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:52,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:52,380 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-18 18:07:52,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:52,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:52,409 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-18 18:07:52,416 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-18 18:07:52,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:07:52,435 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-18 18:07:52,436 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:52,481 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:52,491 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:52,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:52,518 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-18 18:07:52,519 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-18 18:07:52,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:52,560 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-18 18:07:52,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:52,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:07:52,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-18 18:07:52,592 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-18 18:07:52,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:52,605 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-18 18:07:52,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:07:52,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 18:07:52,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:07:52,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 18:07:52,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 18:07:52,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:07:52,627 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-18 18:07:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:52,767 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-18 18:07:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:07:52,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 18:07:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:52,770 INFO L225 Difference]: With dead ends: 32 [2019-01-18 18:07:52,770 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 18:07:52,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:07:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 18:07:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-18 18:07:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 18:07:52,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-18 18:07:52,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-18 18:07:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:52,778 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-18 18:07:52,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 18:07:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-18 18:07:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:07:52,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:52,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:07:52,779 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:52,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:52,779 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-18 18:07:52,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:52,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:52,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:52,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:52,871 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-18 18:07:52,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:52,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:52,872 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:07:52,872 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-18 18:07:52,874 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:52,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:55,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:07:55,081 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:07:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:55,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:07:55,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:55,082 INFO 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-18 18:07:55,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:55,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:07:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:55,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:55,270 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-18 18:07:55,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:55,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:07:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:55,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:07:55,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:55,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:55,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:55,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:55,350 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-18 18:07:55,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:55,364 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:55,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:55,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:07:55,399 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-18 18:07:55,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, 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-18 18:07:55,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:07:55,411 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:55,460 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:55,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:55,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:55,509 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-18 18:07:55,509 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-18 18:07:55,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:55,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 31 treesize of output 45 [2019-01-18 18:07:55,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:55,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:07:55,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 18:07:55,588 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-18 18:07:55,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:55,595 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-18 18:07:55,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:07:55,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 18:07:55,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:55,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:07:55,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:07:55,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 18:07:55,616 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-18 18:07:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:55,659 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-18 18:07:55,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:07:55,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 18:07:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:55,660 INFO L225 Difference]: With dead ends: 22 [2019-01-18 18:07:55,661 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 18:07:55,662 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-18 18:07:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 18:07:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-18 18:07:55,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 18:07:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-18 18:07:55,667 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-18 18:07:55,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:55,667 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-18 18:07:55,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:07:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-18 18:07:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:07:55,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:55,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:07:55,668 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:55,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:55,669 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-18 18:07:55,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:55,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:55,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:55,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:55,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:55,733 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-18 18:07:55,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:55,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:55,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:07:55,734 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-18 18:07:55,735 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:55,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:56,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:07:56,370 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:07:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:56,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:07:56,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:56,371 INFO 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-18 18:07:56,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:56,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:07:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:56,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:56,423 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-18 18:07:56,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-18 18:07:56,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:07:56,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:07:56,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:56,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:56,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:56,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:56,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:07:56,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:07:56,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,674 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-18 18:07:56,674 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:56,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:56,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:56,741 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-18 18:07:56,742 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:07:56,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:07:56,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:56,804 INFO L267 ElimStorePlain]: Start 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-18 18:07:56,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:07:56,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:56,832 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:07:56,833 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-18 18:07:56,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:56,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:07:56,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-18 18:07:56,881 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-18 18:07:56,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:56,913 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-18 18:07:56,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:07:56,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:07:56,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:07:56,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:07:56,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:07:56,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:07:56,934 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-18 18:07:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:57,361 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-18 18:07:57,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:07:57,362 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:07:57,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:57,363 INFO L225 Difference]: With dead ends: 37 [2019-01-18 18:07:57,363 INFO L226 Difference]: Without dead ends: 36 [2019-01-18 18:07:57,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:07:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-18 18:07:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-18 18:07:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 18:07:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-18 18:07:57,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-18 18:07:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:57,370 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-18 18:07:57,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:07:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-18 18:07:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:07:57,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:57,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:07:57,371 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:57,372 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-18 18:07:57,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:57,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:57,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:57,453 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-18 18:07:57,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:57,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:57,453 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:07:57,454 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-18 18:07:57,455 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:57,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:58,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:07:58,074 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:07:58,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:58,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:07:58,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:58,074 INFO 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-18 18:07:58,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:58,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:07:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:58,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:58,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,119 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-18 18:07:58,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,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-18 18:07:58,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,254 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-18 18:07:58,255 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:58,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:58,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:58,336 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-18 18:07:58,340 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-18 18:07:58,343 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-18 18:07:58,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:07:58,350 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:58,371 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:58,380 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:58,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:58,423 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-18 18:07:58,423 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:07:58,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:07:58,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:58,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:07:58,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:07:58,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:58,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:07:58,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:58,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:07:58,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:07:58,588 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-18 18:07:58,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:07:58,632 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-18 18:07:58,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:07:58,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:07:58,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:07:58,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:07:58,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:07:58,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:07:58,654 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-18 18:07:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:59,005 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-01-18 18:07:59,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:07:59,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:07:59,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:59,007 INFO L225 Difference]: With dead ends: 46 [2019-01-18 18:07:59,007 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 18:07:59,008 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-18 18:07:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 18:07:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-01-18 18:07:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 18:07:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-18 18:07:59,022 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-18 18:07:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:59,022 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-18 18:07:59,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:07:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-18 18:07:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:07:59,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:59,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:07:59,023 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-18 18:07:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:59,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:59,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:59,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:59,279 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-18 18:07:59,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:59,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:59,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:07:59,280 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-18 18:07:59,284 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:59,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:59,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:07:59,874 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:07:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:59,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:07:59,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:59,875 INFO 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-18 18:07:59,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:59,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:07:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:59,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:07:59,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 18:07:59,923 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-18 18:07:59,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:59,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:59,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, 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-18 18:07:59,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:59,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:59,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:07:59,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:07:59,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:07:59,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:07:59,994 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:00,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:00,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,092 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-18 18:08:00,092 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,103 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,113 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,133 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-18 18:08:00,134 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:00,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:00,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,181 INFO L267 ElimStorePlain]: Start 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-18 18:08:00,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:00,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:00,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:00,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-18 18:08:00,254 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-18 18:08:00,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:00,273 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-18 18:08:00,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:00,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:08:00,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:00,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:00,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:00,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:00,295 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-18 18:08:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:00,505 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-01-18 18:08:00,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:00,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:00,507 INFO L225 Difference]: With dead ends: 52 [2019-01-18 18:08:00,508 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 18:08:00,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 18:08:00,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-01-18 18:08:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 18:08:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-01-18 18:08:00,519 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-01-18 18:08:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:00,520 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-01-18 18:08:00,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:00,520 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-01-18 18:08:00,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:00,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:00,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:00,521 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:00,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-18 18:08:00,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:00,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:00,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:00,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:00,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:00,583 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-18 18:08:00,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:00,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:00,584 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:00,584 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-18 18:08:00,585 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:00,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:00,720 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:00,720 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:00,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:00,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:00,721 INFO 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-18 18:08:00,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:00,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:00,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:00,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,757 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-18 18:08:00,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,798 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-18 18:08:00,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,820 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-18 18:08:00,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, 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-18 18:08:00,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, 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-18 18:08:00,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-01-18 18:08:00,837 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,851 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,884 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-18 18:08:00,885 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-01-18 18:08:00,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:00,912 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-18 18:08:00,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:00,925 INFO L267 ElimStorePlain]: Start 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-18 18:08:00,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-18 18:08:00,940 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-18 18:08:00,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:00,974 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-18 18:08:00,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:00,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 18:08:00,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:00,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 18:08:00,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 18:08:00,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:08:00,995 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-01-18 18:08:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:01,204 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-01-18 18:08:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:08:01,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 18:08:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:01,208 INFO L225 Difference]: With dead ends: 36 [2019-01-18 18:08:01,208 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 18:08:01,208 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-18 18:08:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 18:08:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-01-18 18:08:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 18:08:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-01-18 18:08:01,216 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-01-18 18:08:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:01,217 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-01-18 18:08:01,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 18:08:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-01-18 18:08:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:01,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:01,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:01,218 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-18 18:08:01,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:01,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:01,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:01,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:01,285 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-18 18:08:01,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:01,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:01,286 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:01,286 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-18 18:08:01,287 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:01,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:01,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:01,534 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:01,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:01,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:01,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:01,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:08:01,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:01,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:01,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:01,585 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-18 18:08:01,588 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-18 18:08:01,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:01,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:01,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:01,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:01,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:01,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:01,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:01,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,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-18 18:08:01,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,827 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-18 18:08:01,828 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:01,843 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:01,863 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:01,892 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-18 18:08:01,892 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:01,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,939 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-18 18:08:01,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:01,962 INFO L267 ElimStorePlain]: Start 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-18 18:08:01,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:01,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:01,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:01,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:02,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:02,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:02,036 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-18 18:08:02,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:02,062 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-18 18:08:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:02,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:02,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:02,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:02,084 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-01-18 18:08:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:02,411 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-01-18 18:08:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:02,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 18:08:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:02,413 INFO L225 Difference]: With dead ends: 52 [2019-01-18 18:08:02,413 INFO L226 Difference]: Without dead ends: 50 [2019-01-18 18:08:02,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-18 18:08:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-01-18 18:08:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 18:08:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-01-18 18:08:02,423 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-01-18 18:08:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:02,423 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-01-18 18:08:02,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-01-18 18:08:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:08:02,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:02,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:08:02,424 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-18 18:08:02,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:02,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:02,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:02,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:02,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:02,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:02,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:02,470 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:08:02,470 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-18 18:08:02,474 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:02,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:02,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:02,618 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:08:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:02,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:02,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:02,619 INFO 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-18 18:08:02,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:02,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:02,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:02,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:08:02,647 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-18 18:08:02,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:02,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,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, 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-18 18:08:02,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:02,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:02,737 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:02,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:02,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:08:02,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:02,929 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-18 18:08:02,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:02,939 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-18 18:08:02,939 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:02,949 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:02,958 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:02,977 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-18 18:08:02,978 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-01-18 18:08:03,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:03,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:03,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-18 18:08:03,080 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-18 18:08:03,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:03,092 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-18 18:08:03,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:03,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 18:08:03,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:03,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 18:08:03,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 18:08:03,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 18:08:03,112 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-01-18 18:08:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:03,241 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-01-18 18:08:03,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:08:03,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 18:08:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:03,243 INFO L225 Difference]: With dead ends: 39 [2019-01-18 18:08:03,243 INFO L226 Difference]: Without dead ends: 38 [2019-01-18 18:08:03,244 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-18 18:08:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-18 18:08:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-01-18 18:08:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 18:08:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-18 18:08:03,253 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-01-18 18:08:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:03,254 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-18 18:08:03,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 18:08:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-18 18:08:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:03,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:03,255 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 18:08:03,255 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:03,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-01-18 18:08:03,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:03,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:03,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:03,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:03,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:03,343 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-18 18:08:03,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:03,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:03,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:03,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:03,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:03,345 INFO 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-18 18:08:03,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:03,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:03,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:03,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:03,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:03,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:03,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,433 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-18 18:08:03,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,473 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-18 18:08:03,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,515 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-18 18:08:03,518 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-18 18:08:03,524 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-18 18:08:03,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:03,544 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,560 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,571 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,580 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,601 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-18 18:08:03,601 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:03,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,621 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-18 18:08:03,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,641 INFO L267 ElimStorePlain]: Start 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-18 18:08:03,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:03,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,667 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-18 18:08:03,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:03,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-01-18 18:08:03,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:03,725 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-18 18:08:03,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:03,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:03,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:03,765 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-18 18:08:03,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:03,797 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-18 18:08:03,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:03,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 18:08:03,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:03,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:08:03,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:08:03,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:03,818 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-01-18 18:08:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:04,231 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-01-18 18:08:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:04,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-18 18:08:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:04,232 INFO L225 Difference]: With dead ends: 65 [2019-01-18 18:08:04,232 INFO L226 Difference]: Without dead ends: 60 [2019-01-18 18:08:04,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:08:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-18 18:08:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-01-18 18:08:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 18:08:04,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-18 18:08:04,244 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-18 18:08:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:04,244 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-18 18:08:04,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:08:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-18 18:08:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:04,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:04,245 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 18:08:04,246 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:04,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-01-18 18:08:04,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:04,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:04,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:04,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:04,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:04,379 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-18 18:08:04,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:04,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:04,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:04,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:04,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:04,380 INFO 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-18 18:08:04,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:04,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:04,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:04,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:04,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:04,423 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-18 18:08:04,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-18 18:08:04,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:04,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:04,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,517 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-18 18:08:04,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,566 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-18 18:08:04,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,602 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-18 18:08:04,602 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,611 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,621 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,642 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-18 18:08:04,643 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:04,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,664 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-18 18:08:04,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,684 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-18 18:08:04,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:04,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,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 57 [2019-01-18 18:08:04,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,739 INFO L267 ElimStorePlain]: Start 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-18 18:08:04,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-18 18:08:04,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:04,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 67 [2019-01-18 18:08:04,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:04,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:04,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:04,810 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-18 18:08:04,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:04,864 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-18 18:08:04,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:04,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-18 18:08:04,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:04,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:08:04,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:08:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:08:04,887 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-01-18 18:08:05,102 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-01-18 18:08:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:05,353 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-01-18 18:08:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:05,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-18 18:08:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:05,355 INFO L225 Difference]: With dead ends: 53 [2019-01-18 18:08:05,355 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 18:08:05,356 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-18 18:08:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 18:08:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-01-18 18:08:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 18:08:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-01-18 18:08:05,366 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-01-18 18:08:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:05,366 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-01-18 18:08:05,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:08:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-01-18 18:08:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:05,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:05,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:05,367 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-18 18:08:05,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:05,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:05,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:05,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:05,423 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-18 18:08:05,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:05,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:05,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:05,424 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-18 18:08:05,425 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:05,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:06,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:06,143 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:06,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:06,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:06,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:08:06,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:06,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:06,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:06,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,216 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-18 18:08:06,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,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-18 18:08:06,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,286 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-18 18:08:06,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:06,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:06,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:06,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:06,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:06,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:06,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:06,335 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:06,352 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:06,362 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:06,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:06,391 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-18 18:08:06,392 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:06,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,425 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-18 18:08:06,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:06,445 INFO L267 ElimStorePlain]: Start 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-18 18:08:06,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:06,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:06,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-18 18:08:06,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:06,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:06,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:06,519 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-18 18:08:06,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:06,541 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-18 18:08:06,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:06,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:06,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:06,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:06,564 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-01-18 18:08:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:06,909 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-01-18 18:08:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:06,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:08:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:06,911 INFO L225 Difference]: With dead ends: 54 [2019-01-18 18:08:06,911 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 18:08:06,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 18:08:06,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-01-18 18:08:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 18:08:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-01-18 18:08:06,923 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-01-18 18:08:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:06,923 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-01-18 18:08:06,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-01-18 18:08:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:06,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:06,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:06,924 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:06,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-01-18 18:08:06,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:06,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:06,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:06,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:06,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:07,054 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-18 18:08:07,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:07,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:07,055 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:07,055 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-18 18:08:07,057 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:07,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:07,766 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:07,766 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:07,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:07,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:07,767 INFO 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-18 18:08:07,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:07,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:07,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:07,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:07,817 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-18 18:08:07,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:07,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:07,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:07,864 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-18 18:08:07,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:07,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:07,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:07,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:07,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:07,916 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-18 18:08:07,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:07,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:07,938 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-18 18:08:07,938 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:07,949 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:07,963 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-18 18:08:07,964 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-18 18:08:07,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,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, 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-18 18:08:08,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-18 18:08:08,101 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-18 18:08:08,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:100 [2019-01-18 18:08:08,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:08,309 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-01-18 18:08:08,310 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-18 18:08:08,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:08,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,686 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:08,687 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-18 18:08:08,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:08,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 44 [2019-01-18 18:08:08,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:08,773 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-18 18:08:08,774 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:97, output treesize:63 [2019-01-18 18:08:08,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:08,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:08,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,872 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:08,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:08,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:08,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:08,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2019-01-18 18:08:08,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:08,955 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-18 18:08:08,956 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-01-18 18:08:08,999 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-18 18:08:09,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:09,015 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-18 18:08:09,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:09,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-01-18 18:08:09,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:09,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:09,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:09,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:09,038 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-01-18 18:08:09,293 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2019-01-18 18:08:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:09,938 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-01-18 18:08:09,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 18:08:09,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 18:08:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:09,940 INFO L225 Difference]: With dead ends: 81 [2019-01-18 18:08:09,940 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 18:08:09,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:08:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 18:08:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-01-18 18:08:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 18:08:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-01-18 18:08:09,954 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-01-18 18:08:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:09,954 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-01-18 18:08:09,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-01-18 18:08:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:09,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:09,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:09,956 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:09,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-18 18:08:09,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:09,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:09,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:10,034 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-18 18:08:10,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:10,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:10,035 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:10,035 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-18 18:08:10,036 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:10,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:10,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:10,967 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:10,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:10,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:10,968 INFO 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-18 18:08:10,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:10,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:11,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:11,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:11,042 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-18 18:08:11,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:11,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:11,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,073 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,084 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,116 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-18 18:08:11,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,157 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-18 18:08:11,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,190 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-18 18:08:11,191 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,200 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,209 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,229 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:11,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:11,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,294 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-18 18:08:11,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:11,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,324 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:11,325 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-18 18:08:11,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,348 INFO L267 ElimStorePlain]: Start 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-18 18:08:11,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-01-18 18:08:11,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:11,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:11,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:11,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:11,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-18 18:08:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:11,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:11,461 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-18 18:08:11,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:11,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:08:11,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:11,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:11,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:11,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:08:11,480 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-01-18 18:08:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:11,935 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-18 18:08:11,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:11,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 18:08:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:11,937 INFO L225 Difference]: With dead ends: 66 [2019-01-18 18:08:11,937 INFO L226 Difference]: Without dead ends: 64 [2019-01-18 18:08:11,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:08:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-18 18:08:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-01-18 18:08:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 18:08:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-18 18:08:11,951 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-18 18:08:11,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:11,951 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-18 18:08:11,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-18 18:08:11,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:11,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:11,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:11,952 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:11,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:11,953 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-18 18:08:11,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:11,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:11,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:11,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:12,211 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-18 18:08:12,233 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-18 18:08:12,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:12,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:12,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:12,234 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-18 18:08:12,235 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:12,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:12,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:12,812 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:12,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:12,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:12,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:12,813 INFO 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-18 18:08:12,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:12,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:12,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:12,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:08:12,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:13,391 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-18 18:08:13,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:13,527 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-18 18:08:13,528 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-18 18:08:13,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:13,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:13,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:13,982 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-18 18:08:14,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:14,047 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-18 18:08:14,081 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-18 18:08:14,082 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:14,293 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:14,403 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:14,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:14,777 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-18 18:08:14,777 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-18 18:08:15,172 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-01-18 18:08:15,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:15,213 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-18 18:08:15,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:15,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-18 18:08:15,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 18:08:15,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:15,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:15,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:15,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:15,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:15,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:15,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:15,461 INFO L267 ElimStorePlain]: Start 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-18 18:08:15,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-18 18:08:15,474 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-18 18:08:15,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:15,505 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-18 18:08:15,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:15,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:08:15,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:15,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:15,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:15,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:15,527 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-01-18 18:08:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:15,796 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-01-18 18:08:15,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:15,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:08:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:15,798 INFO L225 Difference]: With dead ends: 62 [2019-01-18 18:08:15,798 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 18:08:15,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 18:08:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-01-18 18:08:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 18:08:15,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-01-18 18:08:15,815 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-01-18 18:08:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:15,815 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-01-18 18:08:15,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-01-18 18:08:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:15,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:15,816 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:15,817 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:15,817 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-18 18:08:15,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:15,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:15,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:15,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:15,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:15,874 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-18 18:08:15,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:08:15,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 18:08:15,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:15,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:15,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:15,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-18 18:08:15,876 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-01-18 18:08:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:15,942 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-01-18 18:08:15,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:08:15,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 18:08:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:15,944 INFO L225 Difference]: With dead ends: 51 [2019-01-18 18:08:15,944 INFO L226 Difference]: Without dead ends: 46 [2019-01-18 18:08:15,944 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-18 18:08:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-18 18:08:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-01-18 18:08:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 18:08:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-01-18 18:08:15,958 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-01-18 18:08:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:15,959 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-01-18 18:08:15,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:15,959 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-01-18 18:08:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:15,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:15,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:15,960 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:15,960 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-01-18 18:08:15,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:15,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:15,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:15,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:15,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:16,058 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-18 18:08:16,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:16,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:16,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:16,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:16,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:16,059 INFO 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-18 18:08:16,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:16,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:16,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:16,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:16,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:16,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 18:08:16,096 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-18 18:08:16,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:16,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:16,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,194 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-18 18:08:16,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,224 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-18 18:08:16,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,261 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-18 18:08:16,262 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,271 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,279 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,324 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-18 18:08:16,324 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:16,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,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, 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-18 18:08:16,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,375 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-18 18:08:16,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:16,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,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 31 treesize of output 65 [2019-01-18 18:08:16,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,428 INFO L267 ElimStorePlain]: Start 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-18 18:08:16,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-18 18:08:16,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:16,459 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:16,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:16,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:16,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:16,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:08:16,550 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-18 18:08:16,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:16,582 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-18 18:08:16,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:16,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:08:16,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:16,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:16,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:16,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:16,604 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-01-18 18:08:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:17,475 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-01-18 18:08:17,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:08:17,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 18:08:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:17,479 INFO L225 Difference]: With dead ends: 90 [2019-01-18 18:08:17,479 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 18:08:17,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:08:17,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 18:08:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-01-18 18:08:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 18:08:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-01-18 18:08:17,499 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-01-18 18:08:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:17,499 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-01-18 18:08:17,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-01-18 18:08:17,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:17,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:17,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:17,501 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:17,501 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-18 18:08:17,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:17,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:17,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:17,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:17,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:17,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:17,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:17,551 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:17,551 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-18 18:08:17,552 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:17,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:17,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:17,836 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:17,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:17,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:17,837 INFO 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-18 18:08:17,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:17,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:17,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:17,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 18:08:17,919 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-18 18:08:17,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:17,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:17,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-18 18:08:17,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:17,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:18,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,005 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-18 18:08:18,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,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-18 18:08:18,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,090 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-18 18:08:18,091 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:18,102 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:18,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:18,133 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-18 18:08:18,133 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:18,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,169 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-18 18:08:18,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:18,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:18,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:18,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,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, 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-18 18:08:18,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:18,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:18,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-18 18:08:18,314 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-18 18:08:18,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:18,404 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-18 18:08:18,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:18,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:08:18,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:18,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:18,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:18,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:18,425 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-01-18 18:08:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:18,593 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-01-18 18:08:18,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:18,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:08:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:18,595 INFO L225 Difference]: With dead ends: 66 [2019-01-18 18:08:18,596 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 18:08:18,596 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-18 18:08:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 18:08:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-01-18 18:08:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-18 18:08:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-01-18 18:08:18,615 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-01-18 18:08:18,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:18,615 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-01-18 18:08:18,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-01-18 18:08:18,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:18,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:18,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:18,617 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-18 18:08:18,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:18,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:18,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:18,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:18,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:18,667 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-18 18:08:18,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:18,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:18,668 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 18:08:18,668 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-18 18:08:18,669 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:18,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:18,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:18,928 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:18,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:18,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:18,928 INFO 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-18 18:08:18,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:18,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:18,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:18,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:18,969 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-18 18:08:19,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:19,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,043 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-18 18:08:19,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,081 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-18 18:08:19,084 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-18 18:08:19,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:19,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:19,090 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,107 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,117 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,126 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,312 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-18 18:08:19,312 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:19,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,441 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-18 18:08:19,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,466 INFO L267 ElimStorePlain]: Start 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-18 18:08:19,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:19,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,491 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:19,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:19,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:19,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-18 18:08:19,527 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-18 18:08:19,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:19,551 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-18 18:08:19,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:19,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 18:08:19,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:19,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 18:08:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 18:08:19,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:19,572 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-01-18 18:08:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:19,813 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-01-18 18:08:19,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:19,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-18 18:08:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:19,815 INFO L225 Difference]: With dead ends: 63 [2019-01-18 18:08:19,815 INFO L226 Difference]: Without dead ends: 62 [2019-01-18 18:08:19,815 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-18 18:08:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-18 18:08:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-01-18 18:08:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 18:08:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-01-18 18:08:19,835 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-01-18 18:08:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:19,835 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-01-18 18:08:19,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 18:08:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-01-18 18:08:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 18:08:19,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:19,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 18:08:19,836 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:19,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:19,837 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-18 18:08:19,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:19,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:19,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:19,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:19,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:19,897 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-18 18:08:19,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:19,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:19,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:19,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:19,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:19,898 INFO 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-18 18:08:19,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:19,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:19,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 18:08:19,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:19,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:19,935 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-18 18:08:19,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:19,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:19,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:19,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:19,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:19,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,014 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-18 18:08:20,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:20,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,079 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-18 18:08:20,079 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,090 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,100 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,120 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-18 18:08:20,121 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:20,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-18 18:08:20,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,161 INFO L267 ElimStorePlain]: Start 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-18 18:08:20,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:20,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,184 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-18 18:08:20,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:20,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:20,223 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-18 18:08:20,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:20,243 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-18 18:08:20,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:20,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:20,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:20,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:20,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:20,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:20,264 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-01-18 18:08:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:20,469 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-01-18 18:08:20,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:20,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 18:08:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:20,471 INFO L225 Difference]: With dead ends: 86 [2019-01-18 18:08:20,471 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 18:08:20,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:08:20,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 18:08:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-01-18 18:08:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 18:08:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-01-18 18:08:20,492 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-01-18 18:08:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:20,493 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-01-18 18:08:20,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-01-18 18:08:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:20,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:20,493 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-18 18:08:20,494 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:20,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:20,494 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-01-18 18:08:20,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:20,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:20,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:20,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:20,601 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-18 18:08:20,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:20,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:20,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:20,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:20,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:20,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:08:20,620 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:08:20,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:08:20,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:08:20,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:20,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:20,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,648 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-18 18:08:20,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,675 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-18 18:08:20,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,709 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-18 18:08:20,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,748 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-18 18:08:20,751 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-18 18:08:20,753 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-18 18:08:20,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:20,757 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,774 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,782 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,791 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,811 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-18 18:08:20,812 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:20,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,845 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-18 18:08:20,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,864 INFO L267 ElimStorePlain]: Start 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-18 18:08:20,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:20,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,891 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-18 18:08:20,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,914 INFO L267 ElimStorePlain]: Start 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-18 18:08:20,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-18 18:08:20,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:20,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:20,965 INFO L267 ElimStorePlain]: Start 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-18 18:08:20,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:20,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:20,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:20,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:21,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:08:21,042 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-18 18:08:21,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:21,083 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-18 18:08:21,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:21,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-18 18:08:21,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:21,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:21,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:21,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:08:21,107 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-01-18 18:08:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:21,565 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-01-18 18:08:21,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:21,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:08:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:21,567 INFO L225 Difference]: With dead ends: 96 [2019-01-18 18:08:21,567 INFO L226 Difference]: Without dead ends: 90 [2019-01-18 18:08:21,568 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-18 18:08:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-18 18:08:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-01-18 18:08:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 18:08:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-01-18 18:08:21,593 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-01-18 18:08:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:21,594 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-01-18 18:08:21,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-01-18 18:08:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:21,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:21,594 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 18:08:21,594 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-01-18 18:08:21,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:21,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:21,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:21,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:21,763 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-18 18:08:21,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:21,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:21,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:21,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:21,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:21,764 INFO 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-18 18:08:21,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:08:21,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:08:21,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:08:21,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:21,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:21,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:21,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,843 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-18 18:08:21,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:21,907 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-18 18:08:21,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:21,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:21,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:21,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-18 18:08:21,960 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:21,984 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:22,010 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:22,024 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:22,048 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-18 18:08:22,049 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:22,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:22,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:22,110 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-18 18:08:22,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:22,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,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, 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-18 18:08:22,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:22,181 INFO L267 ElimStorePlain]: Start 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-18 18:08:22,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-01-18 18:08:22,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,250 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-18 18:08:22,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:22,278 INFO L267 ElimStorePlain]: Start 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-18 18:08:22,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:22,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:22,380 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-18 18:08:22,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:22,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:22,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-18 18:08:22,429 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-18 18:08:22,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:22,516 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-18 18:08:22,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:22,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 18:08:22,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:22,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:08:22,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:08:22,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:22,537 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-01-18 18:08:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:23,013 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-01-18 18:08:23,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:23,013 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-18 18:08:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:23,015 INFO L225 Difference]: With dead ends: 107 [2019-01-18 18:08:23,015 INFO L226 Difference]: Without dead ends: 106 [2019-01-18 18:08:23,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:08:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-18 18:08:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-01-18 18:08:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 18:08:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-01-18 18:08:23,042 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-01-18 18:08:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:23,042 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-01-18 18:08:23,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:08:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-01-18 18:08:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:23,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:23,043 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 18:08:23,044 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:23,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:23,044 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-01-18 18:08:23,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:23,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:23,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:23,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:23,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:23,170 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-18 18:08:23,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:23,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:23,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:23,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:23,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:23,171 INFO 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-18 18:08:23,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:23,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:23,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:23,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:23,206 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-18 18:08:23,209 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-18 18:08:23,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:23,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,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, 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-18 18:08:23,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,294 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-18 18:08:23,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,324 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-18 18:08:23,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,358 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-18 18:08:23,359 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,379 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,399 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-18 18:08:23,399 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:23,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,423 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-18 18:08:23,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,440 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-18 18:08:23,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:23,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,469 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-18 18:08:23,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,492 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-18 18:08:23,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:23,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:23,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,552 INFO L267 ElimStorePlain]: Start 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-18 18:08:23,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-01-18 18:08:23,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:23,599 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-18 18:08:23,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:23,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:23,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-18 18:08:23,643 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-18 18:08:23,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:23,694 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-18 18:08:23,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:23,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 18:08:23,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:23,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:08:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:08:23,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:23,715 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-01-18 18:08:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:24,144 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-01-18 18:08:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:24,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-18 18:08:24,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:24,146 INFO L225 Difference]: With dead ends: 116 [2019-01-18 18:08:24,147 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 18:08:24,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:08:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 18:08:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-01-18 18:08:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 18:08:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-01-18 18:08:24,171 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-01-18 18:08:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:24,171 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-01-18 18:08:24,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:08:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-01-18 18:08:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:24,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:24,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:24,172 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-18 18:08:24,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:24,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:24,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:24,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:24,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:24,238 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-18 18:08:24,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:24,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:24,239 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:08:24,239 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-18 18:08:24,240 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:24,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:24,769 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:24,769 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:24,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:24,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:24,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:24,770 INFO 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-18 18:08:24,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:24,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:24,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:24,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:24,813 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-18 18:08:24,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 18:08:24,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:24,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:24,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,931 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-18 18:08:24,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:24,965 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-18 18:08:24,966 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,976 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:24,986 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:25,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-18 18:08:25,006 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:25,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:08:25,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:25,050 INFO L267 ElimStorePlain]: Start 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-18 18:08:25,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:25,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:25,077 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-18 18:08:25,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:25,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-18 18:08:25,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:25,124 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-18 18:08:25,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:25,157 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-18 18:08:25,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:25,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:08:25,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:25,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:25,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:25,178 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-01-18 18:08:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:25,473 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-01-18 18:08:25,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:25,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 18:08:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:25,475 INFO L225 Difference]: With dead ends: 72 [2019-01-18 18:08:25,475 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 18:08:25,476 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-18 18:08:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 18:08:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-01-18 18:08:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 18:08:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-01-18 18:08:25,505 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-01-18 18:08:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:25,505 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-01-18 18:08:25,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-01-18 18:08:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:25,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:25,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:25,506 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:25,507 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-18 18:08:25,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:25,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:25,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:25,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:25,587 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-18 18:08:25,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:25,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:25,587 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:08:25,587 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-18 18:08:25,589 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:25,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:26,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:26,181 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:26,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:26,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:26,182 INFO 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-18 18:08:26,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:26,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:26,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:26,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, 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-18 18:08:26,215 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-18 18:08:26,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:26,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:26,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,312 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-18 18:08:26,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,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, 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-18 18:08:26,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,394 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-18 18:08:26,394 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,403 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,413 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,433 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-18 18:08:26,433 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:26,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:26,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,474 INFO L267 ElimStorePlain]: Start 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-18 18:08:26,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:26,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,502 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-18 18:08:26,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,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-18 18:08:26,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:26,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,552 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:26,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:26,554 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-18 18:08:26,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:26,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:26,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:08:26,616 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-18 18:08:26,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:26,654 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-18 18:08:26,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:26,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:08:26,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:26,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:26,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:26,676 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-01-18 18:08:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:27,048 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-01-18 18:08:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:27,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:08:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:27,050 INFO L225 Difference]: With dead ends: 77 [2019-01-18 18:08:27,050 INFO L226 Difference]: Without dead ends: 76 [2019-01-18 18:08:27,050 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-18 18:08:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-18 18:08:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-18 18:08:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 18:08:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-01-18 18:08:27,078 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-01-18 18:08:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:27,078 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-01-18 18:08:27,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-01-18 18:08:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:27,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:27,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:27,079 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-18 18:08:27,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:27,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:27,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:27,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:27,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:27,182 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-18 18:08:27,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:27,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:27,182 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:08:27,182 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-18 18:08:27,183 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:27,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:27,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:27,793 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:27,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:27,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:27,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:27,794 INFO 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-18 18:08:27,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:27,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:27,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:27,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-18 18:08:27,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, 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-18 18:08:27,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:27,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:27,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:27,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:27,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:27,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:27,989 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-18 18:08:27,989 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,000 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,030 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:28,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,057 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-18 18:08:28,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,077 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-18 18:08:28,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:28,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,106 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-18 18:08:28,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,188 INFO L267 ElimStorePlain]: Start 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-18 18:08:28,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:28,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:28,255 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:28,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:28,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:28,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:28,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:08:28,301 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-18 18:08:28,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:28,337 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-18 18:08:28,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:28,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:08:28,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:28,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:28,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:28,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:08:28,359 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-01-18 18:08:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:28,748 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-01-18 18:08:28,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:28,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:08:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:28,750 INFO L225 Difference]: With dead ends: 78 [2019-01-18 18:08:28,750 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 18:08:28,751 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-18 18:08:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 18:08:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-01-18 18:08:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-18 18:08:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-01-18 18:08:28,784 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-01-18 18:08:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:28,784 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-01-18 18:08:28,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:28,784 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-01-18 18:08:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:28,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:28,785 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 18:08:28,785 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-01-18 18:08:28,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:28,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:28,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:28,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:28,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:28,846 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-18 18:08:28,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:28,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:28,847 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:08:28,847 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-18 18:08:28,848 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:28,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:29,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:29,421 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:29,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:29,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:29,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:29,421 INFO 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-18 18:08:29,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:29,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:29,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:29,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,460 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-18 18:08:29,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,500 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-18 18:08:29,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:29,536 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,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, 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-18 18:08:29,575 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-18 18:08:29,578 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-18 18:08:29,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:29,580 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,595 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,613 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,633 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-18 18:08:29,634 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:29,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,657 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-18 18:08:29,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,677 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-18 18:08:29,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:29,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,703 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-18 18:08:29,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,726 INFO L267 ElimStorePlain]: Start 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-18 18:08:29,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:29,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:29,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,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-18 18:08:29,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:08:29,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:29,822 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:29,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, 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-18 18:08:29,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:29,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:29,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:08:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:29,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:29,921 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-18 18:08:29,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:29,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 18:08:29,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:29,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:08:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:08:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:29,942 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-01-18 18:08:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:30,424 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-01-18 18:08:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:30,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-18 18:08:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:30,426 INFO L225 Difference]: With dead ends: 95 [2019-01-18 18:08:30,426 INFO L226 Difference]: Without dead ends: 90 [2019-01-18 18:08:30,427 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-18 18:08:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-18 18:08:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-01-18 18:08:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 18:08:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-01-18 18:08:30,456 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-01-18 18:08:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:30,456 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-01-18 18:08:30,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:08:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-01-18 18:08:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:30,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:30,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:30,457 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:30,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:30,457 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-18 18:08:30,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:30,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:30,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:30,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:30,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:30,607 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-18 18:08:30,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:30,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:30,608 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:08:30,609 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-18 18:08:30,610 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:30,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:30,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:30,796 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:30,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:30,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:30,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 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-18 18:08:30,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:30,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:30,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:30,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, 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-18 18:08:30,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, 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-18 18:08:30,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 18:08:30,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:30,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,897 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:30,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,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, 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-18 18:08:30,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,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, 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-18 18:08:30,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:30,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-18 18:08:30,992 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,003 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,012 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,032 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-18 18:08:31,033 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:31,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,056 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-18 18:08:31,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,076 INFO L267 ElimStorePlain]: Start 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-18 18:08:31,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:31,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:31,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 31 treesize of output 57 [2019-01-18 18:08:31,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:31,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:31,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-18 18:08:31,147 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-18 18:08:31,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:31,165 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-18 18:08:31,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:31,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-18 18:08:31,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:31,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:08:31,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:08:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:31,185 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-01-18 18:08:32,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:32,115 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-01-18 18:08:32,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:32,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-18 18:08:32,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:32,117 INFO L225 Difference]: With dead ends: 90 [2019-01-18 18:08:32,117 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 18:08:32,117 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-18 18:08:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 18:08:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-01-18 18:08:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-18 18:08:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-01-18 18:08:32,156 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-01-18 18:08:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:32,156 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-01-18 18:08:32,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:08:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-01-18 18:08:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:32,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:32,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:32,157 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:32,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:32,157 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-18 18:08:32,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:32,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:32,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:32,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:32,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:32,278 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-18 18:08:32,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:32,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:32,278 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:08:32,279 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-18 18:08:32,279 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:32,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:32,592 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:32,592 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:32,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:32,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:32,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:32,592 INFO 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-18 18:08:32,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:32,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:32,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:32,627 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-18 18:08:32,629 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-18 18:08:32,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:32,650 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-18 18:08:32,651 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,715 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-18 18:08:32,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,738 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-18 18:08:32,739 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,745 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,759 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-18 18:08:32,760 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-01-18 18:08:32,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,792 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-18 18:08:32,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:32,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 18:08:32,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,822 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:32,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:32,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:32,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-18 18:08:32,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:32,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:32,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:32,869 INFO L267 ElimStorePlain]: Start 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-18 18:08:32,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-18 18:08:32,883 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-18 18:08:32,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:32,924 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-18 18:08:32,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:32,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:08:32,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:32,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:32,945 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-01-18 18:08:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:33,281 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-01-18 18:08:33,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:33,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 18:08:33,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:33,284 INFO L225 Difference]: With dead ends: 122 [2019-01-18 18:08:33,284 INFO L226 Difference]: Without dead ends: 121 [2019-01-18 18:08:33,285 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-18 18:08:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-18 18:08:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-01-18 18:08:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 18:08:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-01-18 18:08:33,334 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-01-18 18:08:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:33,334 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-01-18 18:08:33,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-01-18 18:08:33,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:33,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:33,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:33,335 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:33,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:33,336 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-18 18:08:33,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:33,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:33,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:33,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:33,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:33,433 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-18 18:08:33,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:33,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:33,434 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:08:33,434 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-18 18:08:33,435 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:33,435 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:33,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:33,921 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:33,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:33,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:33,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:08:33,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:33,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:33,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:33,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-18 18:08:33,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:33,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:34,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,014 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-18 18:08:34,014 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,024 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,048 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-18 18:08:34,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:34,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:34,064 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-18 18:08:34,065 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,078 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,095 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,113 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-18 18:08:34,114 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-18 18:08:34,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,146 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-18 18:08:34,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,157 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-18 18:08:34,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 18:08:34,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:34,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-18 18:08:34,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,191 INFO L267 ElimStorePlain]: Start 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-18 18:08:34,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 18:08:34,204 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-18 18:08:34,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:34,226 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-18 18:08:34,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:34,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:34,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:34,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:34,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:34,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:34,247 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-01-18 18:08:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:34,475 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-01-18 18:08:34,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 18:08:34,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 18:08:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:34,478 INFO L225 Difference]: With dead ends: 113 [2019-01-18 18:08:34,478 INFO L226 Difference]: Without dead ends: 108 [2019-01-18 18:08:34,478 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-18 18:08:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-18 18:08:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-01-18 18:08:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-18 18:08:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-01-18 18:08:34,533 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-01-18 18:08:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:34,533 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-01-18 18:08:34,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-01-18 18:08:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:34,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:34,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:34,535 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-18 18:08:34,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:34,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:34,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:34,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:34,723 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-18 18:08:34,739 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-18 18:08:34,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:34,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:34,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:34,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:34,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:34,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 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-18 18:08:34,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:34,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:34,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:34,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:34,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:34,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,773 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-18 18:08:34,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,803 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-18 18:08:34,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:34,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-18 18:08:34,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,878 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-18 18:08:34,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, 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-18 18:08:34,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:34,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, 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-18 18:08:34,886 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,903 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,991 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:34,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:35,019 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-18 18:08:35,019 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:35,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,045 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-18 18:08:35,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:35,065 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-18 18:08:35,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:35,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,089 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-18 18:08:35,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:35,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:35,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:35,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,139 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:35,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:35,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:35,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:35,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:35,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:08:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:35,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:35,228 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-18 18:08:35,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:35,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 18:08:35,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:35,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:08:35,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:08:35,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:35,249 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-01-18 18:08:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:35,633 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-01-18 18:08:35,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:35,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-18 18:08:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:35,636 INFO L225 Difference]: With dead ends: 137 [2019-01-18 18:08:35,636 INFO L226 Difference]: Without dead ends: 136 [2019-01-18 18:08:35,636 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-18 18:08:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-18 18:08:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-18 18:08:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-18 18:08:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-01-18 18:08:35,682 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-01-18 18:08:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:35,682 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-01-18 18:08:35,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:08:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-01-18 18:08:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:35,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:35,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:35,684 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-18 18:08:35,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:35,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:35,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:35,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:35,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:36,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:36,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:36,025 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:08:36,025 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-18 18:08:36,026 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:36,026 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:36,616 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:36,616 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:36,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:36,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:36,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:08:36,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:36,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:36,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:36,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:08:36,644 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-18 18:08:36,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,667 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-18 18:08:36,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,675 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,696 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-18 18:08:36,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-18 18:08:36,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-18 18:08:36,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, 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-18 18:08:36,717 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,728 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,735 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,757 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-18 18:08:36,757 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-01-18 18:08:36,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,780 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-18 18:08:36,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-18 18:08:36,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:36,802 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-18 18:08:36,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:36,814 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-18 18:08:36,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-01-18 18:08:36,824 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-18 18:08:36,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:36,845 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-18 18:08:36,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:36,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 18:08:36,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:36,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:36,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:36,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:36,865 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-01-18 18:08:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:37,076 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-01-18 18:08:37,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:08:37,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-18 18:08:37,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:37,079 INFO L225 Difference]: With dead ends: 110 [2019-01-18 18:08:37,079 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 18:08:37,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:08:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 18:08:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-01-18 18:08:37,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-18 18:08:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-01-18 18:08:37,127 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-01-18 18:08:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:37,127 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-01-18 18:08:37,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-01-18 18:08:37,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:37,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:37,128 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-18 18:08:37,128 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:37,129 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-01-18 18:08:37,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:37,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:37,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:37,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:37,254 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-18 18:08:37,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:37,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:37,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:37,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:37,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:37,255 INFO 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-18 18:08:37,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:37,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:37,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:37,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:37,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:37,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:37,302 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-18 18:08:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:37,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:37,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,361 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:37,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,447 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-18 18:08:37,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,498 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-18 18:08:37,499 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,517 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,532 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,561 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-18 18:08:37,562 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:37,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,604 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-18 18:08:37,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,629 INFO L267 ElimStorePlain]: Start 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-18 18:08:37,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:37,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,669 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-18 18:08:37,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,699 INFO L267 ElimStorePlain]: Start 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-18 18:08:37,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-18 18:08:37,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,754 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:37,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:37,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,799 INFO L267 ElimStorePlain]: Start 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-18 18:08:37,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-18 18:08:37,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:37,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:37,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:37,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:37,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:08:37,977 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-18 18:08:37,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:38,020 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-18 18:08:38,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:38,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-18 18:08:38,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:38,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:08:38,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:08:38,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-18 18:08:38,042 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-01-18 18:08:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:38,501 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-01-18 18:08:38,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:08:38,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-18 18:08:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:38,503 INFO L225 Difference]: With dead ends: 124 [2019-01-18 18:08:38,503 INFO L226 Difference]: Without dead ends: 116 [2019-01-18 18:08:38,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:08:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-18 18:08:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-01-18 18:08:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-18 18:08:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-01-18 18:08:38,553 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-01-18 18:08:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:38,553 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-01-18 18:08:38,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:08:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-01-18 18:08:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:38,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:38,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:38,554 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:38,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:38,554 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-01-18 18:08:38,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:38,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:38,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:38,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:38,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:38,708 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-18 18:08:38,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:38,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:38,709 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 18:08:38,709 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-18 18:08:38,711 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:38,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:39,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:39,545 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:08:39,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:39,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:39,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:39,546 INFO 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-18 18:08:39,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:39,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:39,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:39,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:39,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-18 18:08:39,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 18:08:39,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-18 18:08:39,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,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-18 18:08:39,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,712 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-18 18:08:39,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,777 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-18 18:08:39,778 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,788 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,798 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,818 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:39,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,845 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-18 18:08:39,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,866 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-18 18:08:39,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:39,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-18 18:08:39,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,917 INFO L267 ElimStorePlain]: Start 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-18 18:08:39,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-18 18:08:39,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,947 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:39,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,949 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-18 18:08:39,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:39,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:39,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:08:39,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:39,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,005 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:40,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:40,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:40,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:40,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-18 18:08:40,053 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-18 18:08:40,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:40,100 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-18 18:08:40,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:40,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:08:40,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:40,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:08:40,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:08:40,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:40,120 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-01-18 18:08:40,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:40,686 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-01-18 18:08:40,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:40,687 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 18:08:40,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:40,689 INFO L225 Difference]: With dead ends: 137 [2019-01-18 18:08:40,689 INFO L226 Difference]: Without dead ends: 136 [2019-01-18 18:08:40,689 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-18 18:08:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-18 18:08:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-01-18 18:08:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-18 18:08:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-01-18 18:08:40,756 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-01-18 18:08:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:40,756 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-01-18 18:08:40,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:08:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-01-18 18:08:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:40,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:40,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:40,757 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-01-18 18:08:40,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:40,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:40,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:40,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:40,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:40,945 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-18 18:08:40,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:40,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:40,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:40,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:40,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:40,946 INFO 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-18 18:08:40,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:40,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:40,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:40,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:40,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:40,981 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-18 18:08:40,984 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-18 18:08:40,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:40,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:40,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:41,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,066 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-18 18:08:41,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,120 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-18 18:08:41,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,155 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-18 18:08:41,155 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,166 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,196 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:41,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,224 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-18 18:08:41,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,245 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-18 18:08:41,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:41,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,287 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:41,287 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-18 18:08:41,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:41,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-18 18:08:41,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:41,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,362 INFO L267 ElimStorePlain]: Start 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-18 18:08:41,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-18 18:08:41,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,390 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:41,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:41,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-18 18:08:41,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:41,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:41,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-18 18:08:41,438 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-18 18:08:41,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:41,492 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-18 18:08:41,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:41,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:08:41,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:41,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:08:41,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:08:41,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:41,512 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-01-18 18:08:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:42,183 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-01-18 18:08:42,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:08:42,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 18:08:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:42,187 INFO L225 Difference]: With dead ends: 172 [2019-01-18 18:08:42,187 INFO L226 Difference]: Without dead ends: 167 [2019-01-18 18:08:42,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:08:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-18 18:08:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-01-18 18:08:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-18 18:08:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-01-18 18:08:42,240 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-01-18 18:08:42,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:42,240 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-01-18 18:08:42,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:08:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-01-18 18:08:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 18:08:42,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:42,241 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 18:08:42,241 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:42,241 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-01-18 18:08:42,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:42,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:42,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:42,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:42,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:42,417 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-18 18:08:42,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:42,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:42,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:42,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:42,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:42,418 INFO 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-18 18:08:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:08:42,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:08:42,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:08:42,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:42,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:42,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,465 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-18 18:08:42,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:42,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,549 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-18 18:08:42,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,595 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-18 18:08:42,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:42,610 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-18 18:08:42,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:42,624 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,653 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,692 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:42,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,719 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-18 18:08:42,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,739 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-18 18:08:42,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:42,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,769 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:42,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-18 18:08:42,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,793 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-18 18:08:42,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-01-18 18:08:42,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-18 18:08:42,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,846 INFO L267 ElimStorePlain]: Start 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-18 18:08:42,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-01-18 18:08:42,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:42,880 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:42,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-18 18:08:42,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:42,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:42,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-01-18 18:08:42,929 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-18 18:08:42,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:42,992 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-18 18:08:43,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:43,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-18 18:08:43,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:43,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:08:43,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:08:43,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:08:43,013 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-01-18 18:08:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:43,480 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-01-18 18:08:43,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:08:43,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-18 18:08:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:43,482 INFO L225 Difference]: With dead ends: 140 [2019-01-18 18:08:43,482 INFO L226 Difference]: Without dead ends: 135 [2019-01-18 18:08:43,483 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-18 18:08:43,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-18 18:08:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-01-18 18:08:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 18:08:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-01-18 18:08:43,537 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-01-18 18:08:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:43,537 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-01-18 18:08:43,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:08:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-01-18 18:08:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:43,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:43,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:43,538 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:43,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:43,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-18 18:08:43,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:43,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:43,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:43,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:43,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:43,690 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-18 18:08:43,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:43,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:43,690 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:08:43,691 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-18 18:08:43,692 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:43,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:44,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:44,288 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:44,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:44,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:44,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 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-18 18:08:44,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:44,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:44,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:44,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:44,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:44,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:44,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,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 22 treesize of output 45 [2019-01-18 18:08:44,342 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,377 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,412 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-18 18:08:44,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:44,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,476 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-18 18:08:44,476 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,487 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,495 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,516 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:44,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,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 31 treesize of output 45 [2019-01-18 18:08:44,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,565 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-18 18:08:44,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:44,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:44,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,619 INFO L267 ElimStorePlain]: Start 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-18 18:08:44,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:44,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,650 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:44,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:44,652 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-18 18:08:44,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:44,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:44,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-18 18:08:44,703 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-18 18:08:44,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:44,737 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-18 18:08:44,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:44,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:08:44,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:44,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:44,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:44,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:44,757 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-01-18 18:08:45,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:45,271 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-01-18 18:08:45,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:08:45,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 18:08:45,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:45,272 INFO L225 Difference]: With dead ends: 77 [2019-01-18 18:08:45,272 INFO L226 Difference]: Without dead ends: 76 [2019-01-18 18:08:45,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:08:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-18 18:08:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-01-18 18:08:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-18 18:08:45,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-01-18 18:08:45,347 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-01-18 18:08:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:45,347 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-01-18 18:08:45,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-01-18 18:08:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:45,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:45,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:45,348 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-18 18:08:45,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:45,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:45,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:45,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:45,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:45,463 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-18 18:08:45,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:45,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:45,464 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:08:45,464 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-18 18:08:45,467 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:45,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:46,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:46,164 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:08:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:46,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:46,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:46,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:08:46,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:46,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:46,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:46,204 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-18 18:08:46,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:46,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-18 18:08:46,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:46,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,255 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,293 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-18 18:08:46,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,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-18 18:08:46,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,358 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-18 18:08:46,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,399 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:46,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,426 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-18 18:08:46,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,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-18 18:08:46,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:46,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,475 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-18 18:08:46,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,498 INFO L267 ElimStorePlain]: Start 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-18 18:08:46,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:46,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,532 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:46,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-18 18:08:46,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:46,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:08:46,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,591 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:46,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:46,593 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-18 18:08:46,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:46,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:46,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-18 18:08:46,639 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-18 18:08:46,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:46,686 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-18 18:08:46,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:46,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:08:46,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:46,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:08:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:08:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:46,707 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-01-18 18:08:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:47,279 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-01-18 18:08:47,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:08:47,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-18 18:08:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:47,281 INFO L225 Difference]: With dead ends: 86 [2019-01-18 18:08:47,281 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 18:08:47,282 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-18 18:08:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 18:08:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-01-18 18:08:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-18 18:08:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-01-18 18:08:47,365 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-01-18 18:08:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:47,365 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-01-18 18:08:47,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:08:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-01-18 18:08:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:47,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:47,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:47,366 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:47,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:47,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-01-18 18:08:47,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:47,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:47,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:47,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:47,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:47,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:47,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:47,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:08:47,573 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-01-18 18:08:47,575 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:47,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:48,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:48,318 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:48,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:48,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:48,319 INFO 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-18 18:08:48,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:48,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:48,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:48,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:08:48,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:48,451 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-18 18:08:48,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:48,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:48,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:48,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:48,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:48,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:48,491 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-01-18 18:08:48,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:48,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:48,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:08:48,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 18:08:48,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-01-18 18:08:48,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:48,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-18 18:08:48,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:48,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:48,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:48,567 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:48,567 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-18 18:08:48,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:48,580 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-18 18:08:48,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-01-18 18:08:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:48,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:48,611 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-18 18:08:48,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:08:48,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-01-18 18:08:48,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:48,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:08:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:08:48,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-18 18:08:48,631 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-01-18 18:08:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:48,855 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-01-18 18:08:48,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:08:48,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-18 18:08:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:48,856 INFO L225 Difference]: With dead ends: 115 [2019-01-18 18:08:48,856 INFO L226 Difference]: Without dead ends: 110 [2019-01-18 18:08:48,857 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-18 18:08:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-18 18:08:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-01-18 18:08:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 18:08:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-01-18 18:08:48,967 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-01-18 18:08:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:48,967 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-01-18 18:08:48,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:08:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-01-18 18:08:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:48,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:48,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:48,968 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-18 18:08:48,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:48,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:48,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:48,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:48,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:49,396 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-01-18 18:08:49,592 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 18:08:49,704 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-18 18:08:49,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:49,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:49,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:49,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:49,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:49,706 INFO 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-18 18:08:49,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:49,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:49,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:49,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:49,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:49,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:49,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:49,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:49,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:49,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:49,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:49,783 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:49,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:49,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,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, 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-18 18:08:49,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,844 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-18 18:08:49,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,880 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-18 18:08:49,880 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:49,891 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:49,901 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:49,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:49,921 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:49,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:49,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:49,971 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-18 18:08:49,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:49,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:49,998 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:49,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:49,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:50,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-18 18:08:50,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-18 18:08:50,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,051 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-18 18:08:50,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:50,072 INFO L267 ElimStorePlain]: Start 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-18 18:08:50,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-18 18:08:50,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:50,106 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:50,107 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-18 18:08:50,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:50,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:50,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-18 18:08:50,168 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-18 18:08:50,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:50,218 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-18 18:08:50,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:50,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-18 18:08:50,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:50,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:08:50,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:08:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:50,239 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-01-18 18:08:50,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:50,833 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-01-18 18:08:50,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:08:50,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-18 18:08:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:50,835 INFO L225 Difference]: With dead ends: 104 [2019-01-18 18:08:50,835 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 18:08:50,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:08:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 18:08:50,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-01-18 18:08:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 18:08:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-01-18 18:08:50,975 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-01-18 18:08:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:50,975 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-01-18 18:08:50,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:08:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-01-18 18:08:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:50,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:50,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:50,976 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-01-18 18:08:50,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:50,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:50,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:50,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:51,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:51,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:51,222 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:08:51,222 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-18 18:08:51,224 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:51,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:51,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:51,832 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:51,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:51,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:51,832 INFO 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-18 18:08:51,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:51,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:51,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:51,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 18:08:51,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, 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-18 18:08:51,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,869 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-18 18:08:51,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,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, 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-18 18:08:51,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:51,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:08:51,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:51,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-18 18:08:52,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,018 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-18 18:08:52,019 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,028 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,038 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,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-18 18:08:52,057 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-18 18:08:52,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,088 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-18 18:08:52,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,099 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-18 18:08:52,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 18:08:52,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:52,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,136 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-18 18:08:52,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-18 18:08:52,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,155 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:52,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:52,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:52,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:52,174 INFO L267 ElimStorePlain]: Start 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-18 18:08:52,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-01-18 18:08:52,190 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-18 18:08:52,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:52,231 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-18 18:08:52,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:52,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:08:52,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:52,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:52,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:52,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:08:52,251 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-01-18 18:08:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:52,687 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-01-18 18:08:52,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:52,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 18:08:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:52,688 INFO L225 Difference]: With dead ends: 68 [2019-01-18 18:08:52,688 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 18:08:52,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:08:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 18:08:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-01-18 18:08:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-18 18:08:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-01-18 18:08:52,782 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-01-18 18:08:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:52,782 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-01-18 18:08:52,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-01-18 18:08:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:52,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:52,782 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-18 18:08:52,783 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:52,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:52,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-01-18 18:08:52,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:52,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:52,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:52,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:52,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:52,824 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-18 18:08:52,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:08:52,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 18:08:52,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:52,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:52,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:52,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 18:08:52,825 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-01-18 18:08:52,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:52,943 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-01-18 18:08:52,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:08:52,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-18 18:08:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:52,944 INFO L225 Difference]: With dead ends: 54 [2019-01-18 18:08:52,944 INFO L226 Difference]: Without dead ends: 50 [2019-01-18 18:08:52,944 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-18 18:08:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-18 18:08:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-18 18:08:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-18 18:08:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-01-18 18:08:53,035 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-01-18 18:08:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:53,035 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-01-18 18:08:53,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-01-18 18:08:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:53,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:53,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:53,035 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-18 18:08:53,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:53,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:53,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:53,124 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-18 18:08:53,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:53,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:53,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:08:53,125 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-18 18:08:53,125 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:53,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:53,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:53,697 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:08:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:53,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:53,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:53,698 INFO 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-18 18:08:53,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:53,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:53,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:53,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-18 18:08:53,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,776 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-18 18:08:53,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:53,810 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-18 18:08:53,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,823 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:53,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:53,858 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-18 18:08:53,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:53,877 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,904 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,914 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,923 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,943 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-18 18:08:53,943 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:53,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08: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, 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-18 18:08:53,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:53,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:53,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:54,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,022 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:54,022 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-18 18:08:54,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,045 INFO L267 ElimStorePlain]: Start 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-18 18:08:54,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-18 18:08:54,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:54,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:54,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:54,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:54,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-18 18:08:54,117 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-18 18:08:54,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:54,143 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-18 18:08:54,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:54,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 18:08:54,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:54,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:54,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:08:54,165 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-01-18 18:08:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:54,591 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-01-18 18:08:54,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 18:08:54,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 18:08:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:54,593 INFO L225 Difference]: With dead ends: 78 [2019-01-18 18:08:54,593 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 18:08:54,593 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-18 18:08:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 18:08:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-01-18 18:08:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 18:08:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-01-18 18:08:54,708 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-01-18 18:08:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:54,708 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-01-18 18:08:54,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-01-18 18:08:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:54,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:54,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:54,709 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-01-18 18:08:54,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:54,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:54,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:54,823 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-18 18:08:54,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:54,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:54,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:08:54,824 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-18 18:08:54,825 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:54,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:55,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:55,016 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:55,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:55,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:55,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:55,017 INFO 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-18 18:08:55,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:55,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:55,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:55,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:55,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,087 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-18 18:08:55,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,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-18 18:08:55,134 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:55,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:55,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:55,172 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-18 18:08:55,174 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-18 18:08:55,177 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-18 18:08:55,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:55,180 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:55,196 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:55,206 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:55,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:55,235 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-18 18:08:55,235 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:55,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,260 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-18 18:08:55,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:55,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:55,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:55,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 33 treesize of output 67 [2019-01-18 18:08:55,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:55,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:55,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-18 18:08:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:55,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:55,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-18 18:08:55,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:55,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 18:08:55,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:55,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 18:08:55,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 18:08:55,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-18 18:08:55,390 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-01-18 18:08:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:55,848 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-01-18 18:08:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:55,849 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-18 18:08:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:55,849 INFO L225 Difference]: With dead ends: 64 [2019-01-18 18:08:55,850 INFO L226 Difference]: Without dead ends: 56 [2019-01-18 18:08:55,850 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-18 18:08:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-18 18:08:55,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-01-18 18:08:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-18 18:08:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-01-18 18:08:55,951 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-01-18 18:08:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:55,951 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-01-18 18:08:55,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 18:08:55,951 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-01-18 18:08:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:55,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:55,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:55,952 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:55,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:55,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-18 18:08:55,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:55,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:55,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:55,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:55,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:56,035 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-18 18:08:56,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:56,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:56,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:08:56,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:08:56,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:56,036 INFO 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-18 18:08:56,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:08:56,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:08:56,052 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:08:56,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:08:56,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:56,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:08:56,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:56,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,108 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-18 18:08:56,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,178 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-18 18:08:56,181 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-18 18:08:56,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:56,187 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-18 18:08:56,188 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,202 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,238 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-18 18:08:56,238 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-01-18 18:08:56,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,271 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-18 18:08:56,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,284 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-18 18:08:56,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 18:08:56,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-18 18:08:56,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,324 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-18 18:08:56,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-18 18:08:56,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:56,347 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:56,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:56,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:56,366 INFO L267 ElimStorePlain]: Start 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-18 18:08:56,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-18 18:08:56,385 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-18 18:08:56,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:56,430 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-18 18:08:56,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:56,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 18:08:56,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:56,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:56,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:08:56,451 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-01-18 18:08:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:56,925 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-01-18 18:08:56,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 18:08:56,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 18:08:56,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:56,927 INFO L225 Difference]: With dead ends: 76 [2019-01-18 18:08:56,927 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 18:08:56,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:08:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 18:08:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-01-18 18:08:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 18:08:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-01-18 18:08:57,069 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-01-18 18:08:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:57,069 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-01-18 18:08:57,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:57,069 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-01-18 18:08:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 18:08:57,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:57,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:57,070 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-01-18 18:08:57,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:57,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:08:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:57,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:57,187 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-18 18:08:57,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:57,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:57,188 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-18 18:08:57,188 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-01-18 18:08:57,189 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:57,189 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:57,376 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:57,377 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:57,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:57,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:57,377 INFO 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-18 18:08:57,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:57,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:57,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:57,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:08:57,397 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-18 18:08:57,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,423 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-18 18:08:57,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:57,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:57,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-18 18:08:57,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:08:57,481 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,492 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,501 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:57,524 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-18 18:08:57,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,566 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-18 18:08:57,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:08:57,599 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-18 18:08:57,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-18 18:08:57,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,626 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:08:57,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:08:57,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:57,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:08:57,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:57,699 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-18 18:08:57,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-18 18:08:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:57,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:08:57,748 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-18 18:08:57,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:08:57,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-18 18:08:57,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:08:57,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 18:08:57,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 18:08:57,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-01-18 18:08:57,770 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-01-18 18:08:58,282 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-01-18 18:08:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:58,810 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-01-18 18:08:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:08:58,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-18 18:08:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:58,811 INFO L225 Difference]: With dead ends: 90 [2019-01-18 18:08:58,811 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 18:08:58,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-18 18:08:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 18:08:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-01-18 18:08:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-18 18:08:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-01-18 18:08:59,005 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-01-18 18:08:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:59,005 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-01-18 18:08:59,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 18:08:59,005 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-01-18 18:08:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:08:59,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:59,005 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-18 18:08:59,005 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-01-18 18:08:59,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:59,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:59,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:59,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:59,179 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-18 18:08:59,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:59,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:59,180 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:08:59,180 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-18 18:08:59,181 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:59,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:59,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:08:59,667 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:08:59,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:59,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:08:59,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:59,668 INFO 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-18 18:08:59,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:59,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:08:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:59,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:08:59,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 18:08:59,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:08:59,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-18 18:08:59,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:08:59,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,834 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-18 18:08:59,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,867 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-18 18:08:59,867 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,876 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,886 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,906 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-18 18:08:59,907 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-01-18 18:08:59,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,928 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-18 18:08:59,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,947 INFO L267 ElimStorePlain]: Start 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-18 18:08:59,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-18 18:08:59,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:08:59,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:08:59,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:08:59,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:08:59,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:09:00,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:00,026 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-18 18:09:00,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:00,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:00,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-18 18:09:00,075 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-18 18:09:00,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:00,108 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-18 18:09:00,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:00,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-18 18:09:00,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:00,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 18:09:00,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 18:09:00,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-18 18:09:00,129 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-01-18 18:09:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:00,822 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-01-18 18:09:00,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 18:09:00,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 18:09:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:00,823 INFO L225 Difference]: With dead ends: 118 [2019-01-18 18:09:00,824 INFO L226 Difference]: Without dead ends: 106 [2019-01-18 18:09:00,824 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-18 18:09:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-18 18:09:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-01-18 18:09:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-18 18:09:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-01-18 18:09:01,037 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-01-18 18:09:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:01,037 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-01-18 18:09:01,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 18:09:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-01-18 18:09:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:09:01,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:01,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:09:01,038 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:01,038 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-01-18 18:09:01,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:01,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:01,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:01,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:01,232 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-18 18:09:01,408 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-18 18:09:01,499 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-18 18:09:01,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:01,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:01,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:09:01,500 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-01-18 18:09:01,500 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:01,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:02,243 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:02,243 INFO L272 AbstractInterpreter]: Visited 8 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-18 18:09:02,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:02,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:02,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:02,244 INFO 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-18 18:09:02,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:02,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:02,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:02,285 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-18 18:09:02,291 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-18 18:09:02,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-18 18:09:02,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-18 18:09:02,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,380 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-18 18:09:02,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,410 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-18 18:09:02,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,444 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-18 18:09:02,444 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,455 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,485 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:09:02,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-18 18:09:02,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,537 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-18 18:09:02,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:09:02,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,566 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-18 18:09:02,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,589 INFO L267 ElimStorePlain]: Start 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-18 18:09:02,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:09:02,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,620 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:02,621 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-18 18:09:02,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,648 INFO L267 ElimStorePlain]: Start 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-18 18:09:02,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-18 18:09:02,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,738 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:02,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:02,740 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-18 18:09:02,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:02,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:02,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-01-18 18:09:02,787 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-18 18:09:02,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:02,836 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-18 18:09:02,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:02,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-18 18:09:02,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:02,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 18:09:02,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 18:09:02,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:09:02,856 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-01-18 18:09:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:03,793 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-01-18 18:09:03,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 18:09:03,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-18 18:09:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:03,796 INFO L225 Difference]: With dead ends: 124 [2019-01-18 18:09:03,796 INFO L226 Difference]: Without dead ends: 119 [2019-01-18 18:09:03,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-01-18 18:09:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-18 18:09:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-01-18 18:09:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 18:09:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-01-18 18:09:04,078 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-01-18 18:09:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:04,078 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-01-18 18:09:04,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 18:09:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-01-18 18:09:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:09:04,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:04,079 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-18 18:09:04,080 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-01-18 18:09:04,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:04,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:04,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:04,160 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-18 18:09:04,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:04,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:04,160 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-18 18:09:04,160 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-01-18 18:09:04,164 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:04,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:04,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:04,355 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 18:09:04,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:04,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:04,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:04,355 INFO 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-18 18:09:04,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:04,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:04,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:04,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:09:04,394 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-18 18:09:04,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, 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-18 18:09:04,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,424 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-18 18:09:04,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:09:04,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:09:04,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,491 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-18 18:09:04,491 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,498 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,504 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,518 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-18 18:09:04,518 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-01-18 18:09:04,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,555 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-18 18:09:04,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:09:04,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-18 18:09:04,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-18 18:09:04,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,618 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-18 18:09:04,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:09:04,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,672 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-18 18:09:04,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-01-18 18:09:04,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:09:04,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:04,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:09:04,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:04,766 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-18 18:09:04,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-01-18 18:09:04,794 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-18 18:09:04,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:04,831 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-18 18:09:04,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:04,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-18 18:09:04,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:04,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 18:09:04,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 18:09:04,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-18 18:09:04,852 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-01-18 18:09:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:05,617 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-01-18 18:09:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 18:09:05,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-18 18:09:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:05,619 INFO L225 Difference]: With dead ends: 87 [2019-01-18 18:09:05,619 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 18:09:05,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:09:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 18:09:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-01-18 18:09:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 18:09:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-01-18 18:09:05,932 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-01-18 18:09:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:05,932 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-01-18 18:09:05,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 18:09:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-01-18 18:09:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 18:09:05,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:05,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:09:05,933 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:05,933 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-01-18 18:09:05,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:05,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:05,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:05,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:05,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:06,109 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-18 18:09:06,278 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-18 18:09:06,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:06,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:06,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:09:06,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:09:06,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:06,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:09:06,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:09:06,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:09:06,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 18:09:06,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:09:06,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:06,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-18 18:09:06,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:09:06,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,313 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-18 18:09:06,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,319 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-18 18:09:06,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-18 18:09:06,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:09:06,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,421 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-18 18:09:06,421 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,430 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,440 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,458 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-01-18 18:09:06,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,498 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-18 18:09:06,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 18:09:06,558 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-18 18:09:06,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-01-18 18:09:06,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,636 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-18 18:09:06,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,684 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:06,685 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-18 18:09:06,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,715 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-18 18:09:06,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-01-18 18:09:06,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,769 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:06,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:09:06,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:09:06,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,847 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-18 18:09:06,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-01-18 18:09:06,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:09:06,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:06,935 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:06,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-18 18:09:06,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:06,973 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-18 18:09:06,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-01-18 18:09:07,009 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-18 18:09:07,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:07,062 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-18 18:09:07,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:07,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-18 18:09:07,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:07,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 18:09:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 18:09:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-01-18 18:09:07,081 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-01-18 18:09:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:08,347 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-01-18 18:09:08,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 18:09:08,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-18 18:09:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:08,350 INFO L225 Difference]: With dead ends: 186 [2019-01-18 18:09:08,350 INFO L226 Difference]: Without dead ends: 177 [2019-01-18 18:09:08,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-01-18 18:09:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-18 18:09:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-01-18 18:09:08,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-18 18:09:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-01-18 18:09:08,784 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-01-18 18:09:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:08,785 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-01-18 18:09:08,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 18:09:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-01-18 18:09:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:09:08,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:08,785 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:09:08,785 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:08,786 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-01-18 18:09:08,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:08,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:09:08,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:08,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:08,976 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-18 18:09:08,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:08,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:08,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-18 18:09:08,977 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-18 18:09:08,978 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:08,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:09,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 18:09:09,891 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 18:09:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:09,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 18:09:09,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:09,892 INFO 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-18 18:09:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:09,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:09:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:09,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:10,079 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-18 18:09:10,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:09:10,459 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-18 18:09:10,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,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-18 18:09:10,908 WARN L181 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-18 18:09:10,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:10,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,023 INFO L303 Elim1Store]: Index analysis took 113 ms [2019-01-18 18:09:11,024 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-18 18:09:11,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,224 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-18 18:09:11,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:09:11,230 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-18 18:09:11,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-18 18:09:11,232 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,247 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,255 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,264 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,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-18 18:09:11,285 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-01-18 18:09:11,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,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, 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-18 18:09:11,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,330 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-18 18:09:11,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:09:11,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,359 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-18 18:09:11,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,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-18 18:09:11,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-18 18:09:11,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:11,415 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-18 18:09:11,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,442 INFO L267 ElimStorePlain]: Start 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-18 18:09:11,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-18 18:09:11,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:11,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:09:11,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:11,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:11,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-18 18:09:11,534 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-18 18:09:11,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:11,580 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-18 18:09:11,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:11,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-18 18:09:11,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:11,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 18:09:11,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 18:09:11,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-18 18:09:11,601 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-01-18 18:09:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:12,394 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-01-18 18:09:12,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:09:12,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-18 18:09:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:12,400 INFO L225 Difference]: With dead ends: 110 [2019-01-18 18:09:12,400 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 18:09:12,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-18 18:09:12,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 18:09:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-01-18 18:09:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 18:09:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-18 18:09:12,507 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-01-18 18:09:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:12,507 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-18 18:09:12,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 18:09:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-18 18:09:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 18:09:12,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:12,508 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-18 18:09:12,508 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:12,508 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-01-18 18:09:12,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:12,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:12,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:12,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:12,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:12,653 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-18 18:09:12,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:12,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:12,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:09:12,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:09:12,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:12,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 18:09:12,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:09:12,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:09:12,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:09:12,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:09:12,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:12,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-18 18:09:12,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:09:12,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,767 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-18 18:09:12,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,805 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-18 18:09:12,808 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-18 18:09:12,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-18 18:09:12,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-18 18:09:12,815 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,830 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,840 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,867 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-01-18 18:09:12,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,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, 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-18 18:09:12,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,918 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-18 18:09:12,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-18 18:09:12,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,947 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-18 18:09:12,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:12,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:12,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-01-18 18:09:12,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:12,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,008 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:13,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, 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-18 18:09:13,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:13,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:13,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-01-18 18:09:13,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,062 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 18:09:13,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-18 18:09:13,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:13,089 INFO L267 ElimStorePlain]: Start 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-18 18:09:13,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-01-18 18:09:13,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:13,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 35 treesize of output 59 [2019-01-18 18:09:13,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:13,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:13,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-01-18 18:09:13,197 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-18 18:09:13,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:13,321 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-18 18:09:13,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:09:13,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-18 18:09:13,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:09:13,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 18:09:13,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 18:09:13,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-01-18 18:09:13,341 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-01-18 18:09:13,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:13,882 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-01-18 18:09:13,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 18:09:13,882 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-18 18:09:13,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:13,883 INFO L225 Difference]: With dead ends: 32 [2019-01-18 18:09:13,883 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 18:09:13,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-01-18 18:09:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 18:09:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 18:09:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 18:09:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 18:09:13,885 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-01-18 18:09:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:13,885 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 18:09:13,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 18:09:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 18:09:13,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 18:09:13,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 18:09:14,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:14,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:15,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:15,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:15,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:15,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:15,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:15,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:15,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:15,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:15,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:16,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:17,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:18,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:18,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:23,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 18:09:26,169 WARN L181 SmtUtils]: Spent 12.27 s on a formula simplification. DAG size of input: 1504 DAG size of output: 1059 [2019-01-18 18:09:43,056 WARN L181 SmtUtils]: Spent 16.88 s on a formula simplification. DAG size of input: 996 DAG size of output: 75 [2019-01-18 18:09:43,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-18 18:09:43,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-01-18 18:09:43,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-01-18 18:09:43,060 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-18 18:09:43,060 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-18 18:09:43,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-01-18 18:09:43,060 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse16 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse3 1)))) (let ((.cse1 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse15 (select .cse16 ULTIMATE.start_main_p1)) (.cse2 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse11 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse10 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse2 (- 1)))) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse17 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse9 (= 0 .cse15)) (.cse5 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse18 (= 0 (select .cse16 ULTIMATE.start_main_p2))) (.cse7 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse1 (- 1))))) (let ((.cse13 (and .cse0 .cse17 .cse4 .cse9 .cse5 .cse18 (<= 1 (select .cse7 ULTIMATE.start_main_p3)))) (.cse12 (select .cse10 ULTIMATE.start_main_p3)) (.cse14 (<= (+ (select .cse11 ULTIMATE.start_main_p4) 1) 0))) (or (and .cse0 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse1 0) (<= .cse2 0) (= .cse3 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) .cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse5 (<= 0 .cse6)) (and .cse4 (let ((.cse8 (<= (+ (select .cse11 ULTIMATE.start_main_p2) 1) 0))) (or (and (= 0 (select .cse7 ULTIMATE.start_main_p2)) (<= 1 (select .cse7 ULTIMATE.start_main_p1))) (and .cse8 (and .cse9 .cse0)) (and (<= 1 (select .cse10 ULTIMATE.start_main_p1)) .cse8))) (<= .cse1 0) (<= 0 .cse12)) (and .cse13 .cse14) (and .cse13 (= .cse15 (select .cse16 ULTIMATE.start_main_p4))) (and (and .cse17 .cse9 (= 0 .cse12) .cse18) .cse14))))))) [2019-01-18 18:09:43,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-18 18:09:43,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-01-18 18:09:43,060 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-01-18 18:09:43,060 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-18 18:09:43,079 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 06:09:43 BoogieIcfgContainer [2019-01-18 18:09:43,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-18 18:09:43,079 INFO L168 Benchmark]: Toolchain (without parser) took 119172.50 ms. Allocated memory was 140.5 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 108.1 MB in the beginning and 936.1 MB in the end (delta: -828.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-01-18 18:09:43,080 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 18:09:43,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.28 ms. Allocated memory is still 140.5 MB. Free memory was 107.9 MB in the beginning and 105.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-18 18:09:43,081 INFO L168 Benchmark]: Boogie Preprocessor took 28.70 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-18 18:09:43,081 INFO L168 Benchmark]: RCFGBuilder took 339.51 ms. Allocated memory is still 140.5 MB. Free memory was 104.5 MB in the beginning and 94.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-01-18 18:09:43,082 INFO L168 Benchmark]: TraceAbstraction took 118739.51 ms. Allocated memory was 140.5 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 93.9 MB in the beginning and 936.1 MB in the end (delta: -842.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-01-18 18:09:43,084 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.23 ms. Allocated memory is still 140.5 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.28 ms. Allocated memory is still 140.5 MB. Free memory was 107.9 MB in the beginning and 105.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.70 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 339.51 ms. Allocated memory is still 140.5 MB. Free memory was 104.5 MB in the beginning and 94.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 118739.51 ms. Allocated memory was 140.5 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 93.9 MB in the beginning and 936.1 MB in the end (delta: -842.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: 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: 39]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1]) || (((!(p3 == p4) && (((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && !(p1 == p4))) || (1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0))) && #memory_int[p4] <= 0) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p3])) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p3 := #memory_int[p3] + 1][p1] == #memory_int[p3 := #memory_int[p3] + 1][p4])) || ((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 118.6s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 24.3s AutomataDifference, 0.0s DeadEndRemovalTime, 29.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 18.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, 23.1s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 352 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4079744448 FormulaSimplificationTreeSizeReduction, 12.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 39947544 FormulaSimplificationTreeSizeReductionInter, 16.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 35.7s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91459 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...